Shapiro’s problem on polynomials with large partial sums of coefficients

Abstract Given a polynomial _ a_ X^ of degree <d, bounded by one on the unit disk, how large can a₀+a₁+ +aₙ (n<d) get? This question dates back at least to the 1952 thesis work of H. S. Shapiro. In 1978, D. J. Newman gave an exact answer for d=2 (n+1), but there does not seem to have been further progress on the question since. We study variations on exact answers for some related coefficient sums, and answer the original question in an asymptotic sense, provided that n is ‘not too large’ in terms of d. The latter is achieved via a ‘quantitative’ Eneström–Kakeya theorem, while the former is based on certain identities for carefully selected Lagrange interpolators. From the interpolation approach we also obtain a general inequality for coefficient sums t₀ a₀ + + t₃-₁ a₃-₁ for arbitrary complex numbers t₀, , t₃-₁. This inequality fails to be sharp in general, yet it is in some cases and also yields non-trivial bounds for Shapiro’s problem for some choices of n and d.