Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Problem 1044
claims/: The 1 claim page of Problem 1044, one per claimant's result; the problem's standing derives from them.
Statement. Let where $\lvert z_i\rvert\leq 1$ for all . If is the maximum of the lengths of the boundaries of the connected components of
then determine the infimum of .
Status. SOLVED (LEAN) on the site. Tang's note of 2026-01-05 proves that the infimum of is ; the site's curator credits it and Tao read the argument, and it is the accepted claim (Tang's claim page). The Lean qualifier of the site's label is Luccioli's formalization of Tang's note with Aristotle, third-party Lean not built here. The fixed-degree question Tang raises, whether minimizes in each degree , is settled only for and is not part of the problem.
Source. erdosproblems.com/1044, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #1044, https://www.erdosproblems.com/1044.
References.
- [EHP58] Erdős, P. and Herzog, F. and Piranian, G., Metric properties of polynomials. J. Analyse Math. (1958), 125-148.
- [Ta26] Tang, Q., On Erdős Problem #1044. Note with TeX source, https://github.com/QuanyuTang/erdos-problem-1044, uploaded 2026-01-05; unrefereed. Cited on the claim page above at its pinned address.
Formalization. Statement in
formal-conjectures,
read at its revision of 2026-09-18: it credits Tang, tags the problem and
its infimum variant as solved with their proofs left as sorry, and its
formal_proof attribute on both points to the copy of Luccioli's
development in Alexeev's repository, linked from the claim page above
together with the gist; the fixed-degree variant is tagged open.
Progress
Not yet compiled.
Known Results
Not yet compiled.
Linked library material
These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.