The maximal length of the Erd\H{o}s--Herzog--Piranian lemniscate in high degree
Terence Tao

TL;DR
This paper proves that for large degrees, the polynomial p(z) = z^n - 1 maximizes the length of its lemniscate among all monic polynomials of degree n, confirming a longstanding conjecture.
Contribution
It confirms the Erd ext{"o}s--Herzog--Piranian conjecture for all sufficiently large degrees, extending previous partial results.
Findings
The length of the lemniscate is maximized by p(z) = z^n - 1 for large n.
The conjecture holds asymptotically as n approaches infinity.
The analysis builds upon and extends Fryntov and Nazarov's previous work.
Abstract
Let , and let be a monic polynomial of degree . It was conjectured by Erd\H{o}s, Herzog, and Piranian that the maximal length of lemniscate is attained by the polynomial . In this paper, building upon a previous analysis of Fryntov and Nazarov, we establish this conjecture for all sufficiently large .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Limits and Structures in Graph Theory · Mathematical functions and polynomials
