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

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.

published proceedings

  • ACTA ARITHMETICA

author list (cited authors)

  • Erdelyi, T.

citation count

  • 5

complete list of authors

  • Erdélyi, Tamás

publication date

  • January 2016