TOPICS
Search

Erdős-Herzog-Piranian Conjecture


The Erdős-Herzog-Piranian conjecture asserts that, among all monic polynomials p(z) of a fixed positive polynomial degree n with complex coefficients, the level curve |p(z)|=1 has greatest arc length when p(z)=z^n-1 (Erdős et al. 1958). The level curve is taken in the complex plane.

Tao (2025) proved the conjecture for all sufficiently large n. Zhang (2026, Theorem 1.3) reports a proof for every positive polynomial degree. The reported equality cases are precisely p(z)=(z-z_0)^n-e^(itheta), where z_0 is a complex number and theta is a real number. The proof includes computer-assisted estimates in a finite range of degrees.

This is problem 114 in the Erdős problems collection (Bloom 2026).


See also

Arc Length, Erdős Problems, Monic Polynomial

Explore with Wolfram|Alpha

References

Bloom, T. F. "Erdős Problem 114." Accessed Oct. 26, 2026. https://www.erdosproblems.com/114.Erdős, P.; Herzog, F.; and Piranian, G. "Metric Properties of Polynomials." J. Analyse Math. 6, 125-148, 1958. https://doi.org/10.1007/BF02790232.Tao, T. "The Maximal Length of the Erdős-Herzog-Piranian Lemniscate in High Degree." 13 Dec 2025. https://arxiv.org/abs/2512.12455.Zhang, T. "A Proof of the Erdős-Herzog-Piranian Lemniscate Conjecture." 9 Nov 2026. https://arxiv.org/abs/2611.12830v1.

Cite this as:

Weisstein, Eric W. "Erdős-Herzog-Piranian Conjecture." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Erdos-Herzog-PiranianConjecture.html

Subject classifications