An explicit bound below 2/π for the maximum term of an entire function
In plain words
Consider a power series with infinitely many nonzero terms that converges in the whole complex plane, like the exponential function. On the circle of radius r around 0, its largest term is at most its largest absolute value there. In 1961 Erdős asked how large their ratio can stay as r grows. An argument of Clunie gives at most 2/π, about 0.6366. In 1964 Clunie and Hayman showed that the answer is smaller than 2/π by some fixed positive amount, which they did not compute. This paper proves that the ratio cannot stay above 0.63005.
Abstract
For a transcendental entire function f(z) = ∑ akzk, let μ(r) = maxk |ak|rk be its maximum term and M(r) its maximum modulus on |z| = r. Erdős asked for the largest possible value B of lim inf μ(r)/M(r) as r → ∞ (Erdős problem #513). An argument of Clunie gives B ≤ 2/π = 0.636619…, and in 1964 Clunie and Hayman proved B ≤ 2/π − c for an absolute constant c > 0, which they did not compute. The lower bound B > 0.5850788 is due to <a href="https://www.erdosproblems.com/forum/thread/513">Sothanaphan</a>, who improved the parameters of a construction of He and Tang. We prove B ≤ 0.63005. The proof bounds M(r) from below by duality: trigonometric polynomials are tested against the Fourier coefficients of f(reiθ) in a finite window. Two consecutive radii at which the central index jumps involve three consecutive vertices of the Newton polygon of log|ak|. If the two gaps between these vertices are equal, testing f at both radii leads to a problem in six real parameters. If they differ, a single radius is used, and averaging over roots of unity leads to a problem in seven parameters for each value p ≥ 2 of the larger gap divided by the greatest common divisor of the two gaps. Both problems are bounded by branch and bound, with dual vectors certified in ball arithmetic. Two independently written programs check the certificates, which have 176,240 leaves in the equal-gap case and 37,198 in the unequal-gap case.