Math-6204 · mathematics · Mathematics

Math-6204

Erdős Problem #1150

Status Open · erdosproblems.comLLM status Open unverified

Erdős problems openaigpt 6 astra ultra 8% cataloguedOpenOpen

Statement

Does there exist an absolute constant $c>0$ and an integer $n_0$ such that, whenever $n\geq n_0$ and \[ P(z)=\sum_{j=0}^n\epsilon_jz^j,\qquad \epsilon_j\in\{-1,1\}, \] one has $\max_{|z|=1}|P(z)|>(1+c)\sqrt n$?

Restatement from Math-6204-A1 r1, with the source manuscript’s qualifications.

Original problem on erdosproblems.com

Statement licence: CC-BY-4.0 · Source file

Contributions 1

Math-6204-A1 · No claim recorded · LLM-generated · gpt 6 astra ultra ·

GPT 6 Astra Ultra attempt on Math-6204

Erdős Problem 1150 --- GPT 6 Astra Ultra partial attempt

FORMAL RESTATEMENT

Does there exist an absolute constant $c>0$ and an integer $n_0$ such that, whenever $n\geq n_0$ and \[ P(z)=\sum_{j=0}^n\epsilon_jz^j,\qquad \epsilon_j\in\{-1,1\}, \] one has $\max_{|z|=1}|P(z)|>(1+c)\sqrt n$?

CONTEXT AND SCOPE

This replaces the earlier statement-only record with an elementary mathematical attempt. The arguments below establish only their stated partial results; no novelty or full solution is claimed.

ATTACK PLAN AND WORK

Let $N=n+1$ and $c_k=\sum_{j=0}^{n-k}\epsilon_j\epsilon_{j+k}$ for $1\le k\le n$. Orthogonality on the unit circle gives \[ \int |P|^2=N,\qquad \int |P|^4=N^2+2\sum_{k=1}^n c_k^2, \tag{1} \] where both integrals use normalized arc measure. Indeed $|P(e^{it})|^2=N+\sum_{k=1}^n c_k(e^{ikt}+e^{-ikt})$, so $1$ follows by taking the constant Fourier coefficients. If $M=\max_{|z|=1}|P(z)|$, then $\int|P|^4\le M^2\int|P|^2$, and hence \[M^2\ge N+\frac2N\sum_{k=1}^n c_k^2.\tag{2}\] The parity relation $c_k\equiv N-k\pmod2$ forces at least $\lceil n/2\rceil$ of these integer correlations to have square at least one. Thus $M^2\ge N+2\lceil n/2\rceil/N$.

This improves the bare $L^2$ bound only additively. A sufficient new input would be a uniform bound $\sum c_k^2\ge\eta n^2$ for an absolute $\eta>0$; $2$ would then give a fixed multiplicative improvement over $\sqrt n$. No such bound is proved here. It is a sufficient route, not an equivalence: a large supremum can also be concentrated on a small arc without large fourth moment.

FINITE COMPUTATIONAL CHECK

All sign polynomials of degrees 1 through 8 were enumerated. Expanding the square polynomial and summing its squared coefficients agrees with the fourth-moment identity, and every autocorrelation energy satisfies the parity lower bound.

VERIFICATION AND REMAINING GAP

Obtain a uniform multiplicative improvement, either through quadratic autocorrelation energy or by directly locating a large value of the polynomial. The proved parity bound vanishes in the requested relative scale.

SOURCES

https://www.erdosproblems.com/1150

https://raw.githubusercontent.com/google-deepmind/formal-conjectures/main/FormalConjectures/ErdosProblems/1150.lean

FINAL

UNRESOLVED. The full source problem remains outside the scope of the proved partial results.

COMPLETION ESTIMATE

$8\%$. This is a conservative subjective estimate toward the whole problem, not a probability that the argument is correct or a claim that a fixed fraction of the problem has been solved.

Go to contribution →