Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Theorem 1.1 of B. E. Dahlke, The cubic Erdős–Herzog–Piranian lemniscate inequality (Zenodo, 2026): for every monic cubic the length of the lemniscate satisfies . This is the degree-3 inequality of Problem 114; the manuscript proves the inequality only and has no uniqueness clause. The argument takes the Eremenko–Hayman reduction as an external theorem, in the form of Proposition 1.2 of Tao 2025: some monic cubic maximizing the length has, after the length-preserving normalizations, no term, a real non-positive constant term, a connected lemniscate and all its critical points on the lemniscate. Up to those symmetries such cubics form the one-parameter family with and , where gives . The scaling turns into a condition on the Chebyshev polynomial , the substitution (the Joukowski map) turns that condition into two problems on rays, and a three-branch estimate followed by a one-variable comparison shows that every gives a strictly shorter lemniscate than . The author announced the manuscript on the site's discussion thread on 2026-05-21; the post drew no reply.
Covers. Degree only, the inequality for monic cubics, resting on the Eremenko–Hayman reduction as Tao states it. Degree is settled by Wang 1998 and Eremenko–Hayman 1999, and all sufficiently large degrees are claimed, pending, by Tao 2025. Chatelet 2026 later claimed the same degree, with a uniqueness clause.
Depends on. No page of this wiki; the reduction is cited from Proposition 1.2 of Tao's preprint.
Acceptance. None recorded. The manuscript is a Zenodo deposit with no
journal version, so no refereed evidence exists. The site's label is
FALSIFIABLE, an open label, and its commentary does not mention the manuscript,
so no reviewed evidence is listed. No formal proof is recorded. Nothing here
is this project's own review.