Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1
From MaRDI portal
Publication:2787086
DOI10.4064/AA8129-11-2015zbMATH Open1345.26021arXiv1406.2560OpenAlexW256857973MaRDI QIDQ2787086FDOQ2787086
Authors: Tamás Erdélyi 
Publication date: 24 February 2016
Published in: Acta Arithmetica (Search for Journal in Brave)
Abstract: We examine the maximal number of zeros a polynomial of degree at most n with constrained coefficients may have at 1. Our results are essentially sharp and extend earlier results of this variety. An interesting connection to certain extensions of the Coppersmith-Rivlin inequality is explored.
Full work available at URL: https://arxiv.org/abs/1406.2560
Recommendations
Polynomials in number theory (11C08) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Real polynomials: location of zeros (26C10)
Cited In (7)
- On the oscillation of the modulus of the Rudin-Shapiro polynomials on the unit circle
- On the Multiplicity of the Zeros of Polynomials with Constrained Coefficients
- Remembering Peter Benjamin Borwein (May 10, 1953 -- August 23, 2020)
- Sharp bounds for population recovery
- Recent progress in the study of polynomials with constrained coefficients
- On the order of vanishing at 1 of a polynomial
- Improved results on the oscillation of the modulus of the Rudin-Shapiro polynomials on the unit circle
This page was built for publication: Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2787086)
