Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1
For n ∈ ℕ, L > 0, and p ≥ 1 let be the largest possible value of k for which there is a polynomial P ≢ 0 of the form , , , such that divides P(x). For n ∈ ℕ, L > 0, and q ≥ 1 let be the smallest value of k for which there is a polynomial Q of degree k with complex coefficients such that . We find the size of and for all n ∈ ℕ, L > 0, and 1 ≤ p,q ≤ ∞. The result about is due to Coppersmith and Rivlin, but our proof is completely different and much shorter even in that special...