Erdős Problem #1150
Editorial depth: Authored explanatory DRAFT — NOT editorially accepted.
Snapshot classification: open (not automatically the live result).
Subject areas: analysis, polynomials.
Read this status correctly
The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.
UNACCEPTED DRAFT — mathematical editorial review pending
This material is a provisional, source-qualified manuscript published for line-by-line scrutiny and real HTML/LaTeX testing. It has NOT received separate GCL editorial acceptance or independent mathematical certification. Its presence on this website is not evidence of a solution, reviewed coverage, or final publication.
Review the underlying draft on GitHub.
The question in plain language
Erdős Problem #1150 concerns the following mathematical question and its exact quantifiers:
For every polynomial P(z)=sum_{j=0}^n epsilon_j z^j of DEGREE n with ALL n+1 coefficients epsilon_j in {-1,1}, ask if there exists absolute c>0 such that for all sufficiently large n EVERY such polynomial satisfies max_{|z|=1}|P(z)|>(1+c)sqrt(n). The website phrases 'ultraflat' question; distinguish strict >, degree n versus n coefficients, and unrestricted complex unimodular coefficients, where ultraflat examples are known.
A small example
For P(z)=1+z+z²+z³, triangle inequality upper bound 4 and equality at z=1 give exact sup=4, while unit-circle mean square=4, hence Parseval lower bound2. A two-polynomial Rudin–Shapiro step P1=1+z,Q1=1-z has |P1|²+|Q1|²=4 everywhere on unit circle, providing explicit flatness control but NOT sharp sqrt(n) asymptotics or the desired universal gap.
What is known
https://www.erdosproblems.com/1150 OPEN [Ha74,4.31][Va99,2.36]; weaker #228 and complex phase case #230 distinct. Parseval proves sup >=sqrt(n+1), not uniform (1+c)sqrt(n) for fixed c. Published literature on Littlewood flat polynomials and Rudin–Shapiro does not settle universal gap with binary coefficients; pinned formal-conjectures 1150.lean theorem has sorry and Parseval variant placeholder. Formalized conjecture is not proved.
GCL's current state
Authenticated original-issue source return established the bounded source and finite-evidence interface. The Parseval bound concerns \(n+1\) coefficient terms for a polynomial of degree \(n\); it is not the requested fixed relative gap.
All general results cited here remain external until primary-source review.
What remains
ERDOS-1150-LITTLEWOOD-ULTRAFLAT-001: lock original Hayman/Vardi statement n versus n+1 and strict inequality; independently review known Littlewood and Rudin–Shapiro bounds and modern negative/positive results, test finite exact sup norms by real trigonometric-polynomial certification rather than samples alone.
General constant-gap conjecture OPEN; no verified argument for or against fixed c>0.
Sources and claim boundaries
https://www.erdosproblems.com/1150 ; [Ha74,4.31],[Va99,2.36], #228,#230; finite Parseval identity.
This is a source-bound, unaccepted editorial draft. Neither protected cohort admission nor proof or Lean certification is implied.
Catalogue and evidence provenance
- Pinned catalogue source: teorth/erdosproblems at
536408716724. - GCL issue: #2421 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
- GCL triage: PROTECTED_READY_BACKLOG.
- Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
- External mathematical status: consult current problem page and its dated bibliography.