Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1

2014/06/10 by Tamas Erdelyi, Erdelyi, Tamas · 1 citation
Mathematics · #FOS: Mathematics #Number Theory (math.NT) #math.NT

paper · pdf · doi:10.48550/arxiv.1406.2560

arxiv created 2014/06/10 · arxiv updated 2014/06/11

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.

Cited by

• Model-agnostic super-resolution in high dimensions

Related

• Schoenberg type inequalities
• A Note on a result due to Ankeny and Rivlin
• Improved fewnomial upper bounds from Wronskians and dessins d'enfant
• Bounds for zeros of Collatz polynomials, with necessary and sufficient strictness conditions
• In search of Newton-type inequalities