Related papers: Pointwise Remez inequality

The theory of Chebyshev (uniform) approximation for univariate polynomial and piecewise polynomial functions has been studied for decades. The optimality conditions are based on the notion of alternating sequence. However, the extension the…

We survey results on Chebyshev polynomials centered around the work of H. Widom. In particular, we discuss asymptotics of the polynomials and their norms and general upper and lower bounds for the norms. Several open problems are also…

We make a number of comments on Chebyshev polynomials for general compact subsets of the complex plane. We focus on two aspects: asymptotics of the zeros and explicit Totik--Widom upper bounds on their norms.

We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve…

Extremal problems for typically real polynomials go back to a paper by W. W. Rogosinski and G. Szeg\H{o}, where a number of problems were posed, which were partially solved by using orthogonal polynomials. Since then, not too many new…

We introduce and study the unconstrained polarization (or Chebyshev) problem which requires to find an $N$-point configuration that maximizes the minimum value of its potential over a set $A$ in $p$-dimensional Euclidean space. This problem…

We prove a few interesting inequalities for Lorentz polynomials including Nikolskii-type inequalities. A highlight of the paper is a sharp Markov-type inequality for polynomials of degree at most n with real coefficients and with derivative…

Let $\Gamma$ be a $C^{2+}$ Jordan arc and let $\Gamma_0$ be the open arc which consists of interior points of $\Gamma$. We find concrete upper and lower bounds for the limit of Widom factors for $L_2(\mu)$ extremal polynomials on $\Gamma$…

Thiran and Detaille give an explicit formula for the asymptotics of the sup-norm of the Chebyshev polynomials on a circular arc. We give the so-called $\textrm{Szeg\H o}$-Widom asymptotics for this domain, i.e., explicit expressions for the…

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…

Given $n$ polynomials $p_1, \dots, p_n$ of degree at most $n$ with $\|p_i\|_\infty \le 1$ for $i \in [n]$, we show there exist signs $x_1, \dots, x_n \in \{-1,1\}$ so that \[\Big\|\sum_{i=1}^n x_i p_i\Big\|_\infty < 30\sqrt{n}, \] where…

We consider a new multivariate generalization of the classical monic (univariate) Chebyshev polynomial that minimizes the uniform norm on the interval $[-1,1]$. Let $\Pi^*_n$ be the subset of polynomials of degree at most $n$ in $d$…

Using classical results of Rogers bounding the $L^2$-norm of Siegel transforms, we give bounds on the heights of approximate integral solutions of quadratic equations and error terms in the quantiative Oppenheim theorem of…

We raise a conjecture that asymptotics for Chebyshev polynomials in a complex domain can be given in terms of the reproducing kernels of a suitable Hilbert space of analytic functions in this domain. It is based on two classical results due…

Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{i=1}^n |A_i A_{i+1}|=1$. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of…

In this paper we study the Remez-type inequalities for trigonometric polynomials with harmonics from hyperbolic crosses. The interrelation between the Remez and Nikolskii inequalities for individual functions and its applications are…

The article is concerned with polynomials $g(x)$ whose graphs are "partially packed" between two horizontal tangent lines. We assume that most of the local maximum points of $g(x)$ are on the first horizontal line, and most of the local…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

To analyze the absolute condition number of multivariate polynomial interpolation on Lissajous-Chebyshev node points, we derive upper and lower bounds for the respective Lebesgue constant. The proof is based on a relation between the…

Proving super-polynomial lower bounds on the size of proofs of unsatisfiability of Boolean formulas using resolution over parities is an outstanding problem that has received a lot of attention after its introduction by Raz and Tzamaret…