AbstractRecently, weighted Markov and Bernstein inequalities have been established for large classes of Freud weights, that is, weights of the form W(x) ≔e−Q(x), where Q(x) is even and of smooth polynomial growth at infinity. In this paper, we consider Erdős weights, which have the form W(x) ≔e−Q(x), where Q(x) is even and of faster than polynomial growth at infinity. For a large class of Erdős weights, we establish the Markov type inequality ‖P′‖R⩽CD′(an)‖PW‖R, (1) for n ⩾ 1 and P any polynomial of degree at most n. Here the norm is the sup norm, and C is independent of n and P, while an is the Mhaskar-Rahmanov-Saff number, that is, it is the positive root of the equation n = 2n∝01antQ′(ant)dt√1 − t2 For example, we consider Q(x) ≔expk(||α...
Much of weighted polynomial approximation originated with the famous Bernstein qualitative approxim...
AbstractFor a polynomial Pn of total degree n and a bounded convex set S it will be shown that for 0...
AbstractMarkov's inequality asserts that max−1⩽x⩽1|p′(x)|⩽n2max−1⩽x⩽1|p(x)| (1) for every polynomial...
AbstractLet W := e−q, where QR→R is even, sufficiently smooth, and of faster than polynomial growth ...
AbstractAn Erdős weight is of the formW≔e−QwhereQis even and of faster than polynomial growt...
AbstractLet W(x) = exp(− Q(x)) be a weight on the real line, with Q satisfying conditions typicaily ...
AbstractWe consider exponential weights of the formw≔e−Qon (−1,1) whereQ(x) is even and grows faster...
We initiate the study of the Bernstein-Markov type inequalities for the so called asymmetric weights...
AbstractWe prove converse and smoothness theorems of polynomial approximation in weightedLpspaces wi...
AbstractRLet W ≔ e−Q where Q is even, sufficiently smooth, and of faster than polynomial growth at i...
AbstractLet W := e−Q, where Q:R → R is even, and “smooth,” and of faster than polynomial growth at i...
AbstractLet Fn denote the set of polynomials of degree at most n with coefficients from {−1,0, 1}. L...
AbstractLet W(x) = exp(− Q(x)) be a weight on the real line, with Q satisfying conditions typicaily ...
AbstractLet α > 1. For each positive integer n, a polynomial Sn(x) of degree ⩽ n is constructed such...
AbstractWe consider exponential weights of the formw≔e−Qon [−1,1] whereQ(x) is even and grows faster...
Much of weighted polynomial approximation originated with the famous Bernstein qualitative approxim...
AbstractFor a polynomial Pn of total degree n and a bounded convex set S it will be shown that for 0...
AbstractMarkov's inequality asserts that max−1⩽x⩽1|p′(x)|⩽n2max−1⩽x⩽1|p(x)| (1) for every polynomial...
AbstractLet W := e−q, where QR→R is even, sufficiently smooth, and of faster than polynomial growth ...
AbstractAn Erdős weight is of the formW≔e−QwhereQis even and of faster than polynomial growt...
AbstractLet W(x) = exp(− Q(x)) be a weight on the real line, with Q satisfying conditions typicaily ...
AbstractWe consider exponential weights of the formw≔e−Qon (−1,1) whereQ(x) is even and grows faster...
We initiate the study of the Bernstein-Markov type inequalities for the so called asymmetric weights...
AbstractWe prove converse and smoothness theorems of polynomial approximation in weightedLpspaces wi...
AbstractRLet W ≔ e−Q where Q is even, sufficiently smooth, and of faster than polynomial growth at i...
AbstractLet W := e−Q, where Q:R → R is even, and “smooth,” and of faster than polynomial growth at i...
AbstractLet Fn denote the set of polynomials of degree at most n with coefficients from {−1,0, 1}. L...
AbstractLet W(x) = exp(− Q(x)) be a weight on the real line, with Q satisfying conditions typicaily ...
AbstractLet α > 1. For each positive integer n, a polynomial Sn(x) of degree ⩽ n is constructed such...
AbstractWe consider exponential weights of the formw≔e−Qon [−1,1] whereQ(x) is even and grows faster...
Much of weighted polynomial approximation originated with the famous Bernstein qualitative approxim...
AbstractFor a polynomial Pn of total degree n and a bounded convex set S it will be shown that for 0...
AbstractMarkov's inequality asserts that max−1⩽x⩽1|p′(x)|⩽n2max−1⩽x⩽1|p(x)| (1) for every polynomial...