Erdős Problem #1150 — Supremum Norms of Littlewood Polynomials
Does there exist a constant such that, for all sufficiently large integers and every polynomial satisfying
and, for every ,
one has
References
Primary source
Additional references
Pinned Formal Conjectures source, Apache-2.0.
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 1
RemarkAI-assistedClaimed by OpenAI. The manuscript claims that the least possible unit-circle maximum of a real-sign polynomial with N terms is (1+o(1))*sqrt(N) through all integer lengths. This contradicts the target’s proposed universal fixed positive gap above sqrt(degree). The manuscript also deduces unbounded binary merit factor; this manuscript alone does not claim two-sided ultraflatness.See full solution
Claimed by OpenAI. The manuscript claims that the least possible unit-circle maximum of a real-sign polynomial with N terms is (1+o(1))*sqrt(N) through all integer lengths. This contradicts the target’s proposed universal fixed positive gap above sqrt(degree). The manuscript also deduces unbounded binary merit factor; this manuscript alone does not claim two-sided ultraflatness.
GitHub repository: https://github.com/openai/math
- OpenAI-076-03-Asymptotically-minimal-maxima-of-real-Littlewood-polynomials.pdfOpen