Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1
classification
🧮 math.NT
keywords
coppersmith-rivlinresultscertaincoefficientsconnectionconstraineddegreeearlier
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.