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

From MaRDI portal
Publication:2787086




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 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)