Related papers: Pointwise Remez inequality

The paper deals with a special filtered approximation method, which originates interpolation polynomials at Chebyshev zeros by using de la Vall\'ee Poussin filters. These polynomials can be an useful device for many theoretical and…

We study density and partition properties of polynomial equations in prime variables. We consider equations of the form $a_1h(x_1) + \cdots + a_sh(x_s)=b$, where the $a_i$ and $b$ are fixed coefficients, and $h$ is an arbitrary integer…

In this article we obtain an "off-diagonal" version of the Fefferman-Stein vector-valued maximal inequality on weighted Lebesgue spaces with variable exponents. As an application of this result and the atomic decomposition developed in [12]…

A classic result of Ritt describes polynomials invertible in radicals: they are compositions of power polynomials, Chebyshev polynomials and polynomials of degree at most 4. In this paper we prove that a polynomial invertible in radicals…

Uniform polynomial approximation, also called minimax approximation or Chebyshev approximation, consists in searching polynomial approximation that minimizes the worst case error. Optimality conditions for the uniform approximation of…

We provide upper bounds for the size of subsets of finite fields lacking the polynomial progression $$ x, x+y, ..., x+(m-1)y, x+y^m, ..., x+y^{m+k-1}.$$ These are the first known upper bounds in the polynomial Szemer\'{e}di theorem for the…

The Schinzel hypothesis essentially claims that finitely many irreducible polynomials in one variable over Z simultaneously assume infinitely many prime values unless there is an obvious reason why this is impossible. We prove that under a…

We prove non asymptotic linear convergence rates for the constrained Anderson acceleration extrapolation scheme. These guarantees come from new upper bounds on the constrained Chebyshev problem, which consists in minimizing the maximum…

The classical Alexandrov estimate controls the oscillation of a convex function by the mass of its associated Monge-Amp\`ere measure and yields, for two convex functions of $n$ variables with the same boundary values, a sup-norm bound with…

A variant of the well-known Chebyshev inequality for scalar random variables can be formulated in the case where the mean and variance are estimated from samples. In this paper we present a generalization of this result to multiple…

The Riesz-Sobolev inequality provides an upper bound for a trilinear expression involving convolution of indicator functions of sets. It is known that equality holds only for homothetic ordered triples of appropriately situated ellipsoids.…

We establish best possible pointwise (up to a constant multiple) estimates for approximation, on a finite interval, by polynomials that satisfy finitely many (Hermite) interpolation conditions, and show that these estimates cannot be…

We show that any weighted geometric mean of Chebyshev polynomials is bounded from above by another Chebyshev polynomial. We also study a related homogeneous cyclic inequality $$ \left (\sum_{i=1}^n x_i^{(a+b+1)/2} \right )^2 \geq…

In this paper we obtain new results concerning maximum modulus of the polar derivative of a polynomial with restricted zeros. Our results generalize and refine upon the results of Aziz and Shah [An integral mean estimate for polynomial,…

We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

We consider the classical problem of estimating norm of the derivative of algebraic polynomial via the norm of polynomial itself. The corresponding extremal problem for general polynomials in uniform norm was solved by V. Markov. In this…

We study upper bounds for sums of Dirichlet characters. We prove a uniform upper bound of the character sum over all proper generalized arithmetic progressions, which generalizes the classical Polya and Vinogradov inequality. Our argument…

We establish convergence in norm and pointwise almost everywhere for the non-conventional (in the sense of Furstenberg) bilinear polynomial ergodic averages \[ A_N(f,g)(x) := \frac{1}{N} \sum_{n =1}^N f(T^nx) g(T^{P(n)}x)\] as $N \to…

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…