Littlewood-Type Problems on [0,1]
Small fractional parts of polynomials and generalizations (11J54) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Special polynomials in general fields (12E10) Real polynomials: location of zeros (26C10) Maximum principle, Schwarz's lemma, Lindelöf principle, analogues and generalizations; subordination (30C80)
Let \(p(x)=\sum_{j=0}^na_jx^j\) be a polynomial with complex coefficients \(a_j\) restricted in various ways. For such polynomials \(p(x)\) the authors discuss (i) the number of zeros at \(1\) in the sense of multiplicity, (ii) the Chebyshev problem on \([0,1]\), and (iii) the number of real zeros. Variants of these questions have begun with Bloch, Pólya, Schur, Szegő, Turán, Littlewood, Rudin-Shapiro, Erdős and others. The authors give a survey of the basic results and conjectures in (i)--(iii) and sharpen and generalize some of them. To illustrate: In (i) they find that there is an absolute constant \(c>0\) such that every polynomial \(p(x)\) with \(| a_j| \leq1\), \(a_j\in\mathbb C\), has at most \(c\sqrt{n(1-\log | a_0| )}\) zeros at \(1\) (\(a_0\) can be replaced by \(a_n\)). This sharpens results of \textit{F.~Amaroso} [Ann. Inst. Fourier 40, 885--911 (1990; Zbl 0713.41004)] and \textit{E.~Bombieri} and \textit{J.~Vaaler} [in: Analytic number theory and diophantine problems, Proc. Conf., Stillwater/ Okla. 1984, Prog. Math. 70, 53--73 (1987; Zbl 0629.10024)]. In (ii) the authors prove that there are absolute constants \(c_1>0\) and \(c_2>0\) such that \(e^{-c_1\sqrt{n}}\leq\inf_{p(x)}\max_{x\in[0,1]}| p(x)| \leq e^{-c_2\sqrt{n}}\), where the infimum is taken over all polynomials \(p(x)\) with \(| a_j| \leq1\), \(a_j\in\mathbb C\), and the first non-zero coefficient of \(p(x)\) has the absolute value \(=1\). In (iii) they prove that there is an absolute constant \(c>1\) such that every polynomial \(p(x)\) with \(| a_j| \leq1\), \(| a_0| =1\), \(a_j\in\mathbb C\) has at most \(c\sqrt{n}\) zeros in \([-1,1]\). This improves the old bound \(c\sqrt{n\log n}\) given by \textit{I.~Schur} [Sitzungsber. Preuss. Akad. Wiss., Phys.-Math. Kl. 1933, No. 7/10, 403--428 (1933; Zbl 0007.00101)] and up to the constant \(c\) it is the best possible result. The main tools used in proofs are Hadamard's three-circles theorem and the authors' theorem: For every analytic function \(f(z)\) on the open unit disk for which \(| f(z)| \leq1/(1-| z| )\) there are absolute constants \(c_1,c_2>0\) such that \(| f(0)| ^{c_1/t}\leq e^{c_2/t}\max_{x\in[1-t,1]}| f(x)| \) for every \(t\in(0,1]\). The authors provide a bibliography with 42 items.
- On the order of vanishing at 1 of a polynomial
- scientific article; zbMATH DE number 4083993
- scientific article; zbMATH DE number 4053984
- scientific article; zbMATH DE number 1089924
- A bound for the zeros of polynomials
- scientific article; zbMATH DE number 149720
- Markov inequality for polynomials of degree \(n\) with \(m\) distinct zeros
- scientific article; zbMATH DE number 772761
- On the location of the zeros of a polynomial
- Polynomials with high multiplicity at unity and Tarry's problem
- Extensions of the Bloch-Pólya theorem on the number of real zeros of polynomials
- Markov inequalities for polynomials with restricted coefficients
- Zeros of polynomials with 0, 1 coefficients
- On the zeros of polynomials with restricted coefficients
- Reconstruction from subsequences.
- Optimal mean-based algorithms for trace reconstruction
- Questions about polynomials with \(\{ 0,-1,+1\}\) coefficients: Research problems 96-3
- Quantitative correlation inequalities via extremal power series
- On the word fragment length for unambiguous reconstruction of a periodic word from a complete multiset of fragments of fixed length
- The shape of Thurston's master teapot
- Sums of monomials with large Mahler measure
- An improvement of the Erdős-Turán theorem on the distribution of zeros of polynomials
- On the relations between the zeros of a polynomial and its Mahler measure
- The Riemann problem with small parameter in the space \(L_ 2(\mathbb R)\).
- Littlewood polynomials and applications of them in the spectral theory of dynamical systems
- Reconstruction of matrices from submatrices
- The Krzyz Problem and Polynomials with Zeros on the Unit Circle
- Recent progress in the study of polynomials with constrained coefficients
- scientific article; zbMATH DE number 3873439 (Why is no real title available?)
- George Lorentz and inequalities in approximation
- Polynomials with Height 1 and Prescribed Vanishing at 1
- Roots of complex polynomials and Weyl-Heisenberg frame sets
- On some polynomials and series of Bloch-Pólya type
- Polynomials with Restricted Coefficients and Prescribed Noncyclotomic Factors
- Flatness of conjugate reciprocal unimodular polynomials
- On the oscillation of the modulus of the Rudin-Shapiro polynomials on the unit circle
- Sharp bounds for population recovery
- On Newman and Littlewood polynomials with a prescribed number of zeros inside the unit disk
- On the Multiplicity of the Zeros of Polynomials with Constrained Coefficients
- Polynomials with multiple roots at 1
- Improved results on the oscillation of the modulus of the Rudin-Shapiro polynomials on the unit circle
- Markov-Bernstein type inequalities under Littlewood-type coefficient constraints
- On the zeros of polynomials with Littlewood-type coefficient constraints
- On polynomials with only rational roots
- Sieve-type lower bounds for the Mahler measure of polynomials on subarcs
- Remembering Peter Benjamin Borwein (May 10, 1953 -- August 23, 2020)
- The size of exponential sums on intervals of the real line
- Reconstruction of hypermatrices from subhypermatrices
- Extensions of the Bloch-Pólya theorem on the number of real zeros of polynomials. II
- The Newman algorithm for constructing polynomials with restricted coefficients and many real roots
- Trace reconstruction from local statistical queries
- Polynomial-time trace reconstruction in the smoothed complexity model
- Deterministic sub-exponential algorithm for discounted-sum games with unary weights
- Circular trace reconstruction
- Quantitative correlation inequalities via semigroup interpolation
- Recovery of cyclic words by their subwords
- The number of real zeros of polynomials with constrained coefficients
- Trace reconstruction of matrices and hypermatrices
- Reconstruction from smaller cards
- Pseudo-Boolean functions and the multiplicity of the zeros of polynomials
- Two Turán type inequalities
This page was built for publication: Littlewood-Type Problems on [0,1]
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4487576)
