Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. The preprint el Houcein el Abdalaoui, A generalization of Littlewood's LαL^\alpha flat theorem, α>0\alpha>0, arXiv:2509.04212 (one version, posted 2025-09-04), states as Theorem 1 a weighted criterion: no sequence of analytic polynomials Pn(z)=∑m=1ncmzmP_n(z)=\sum_{m=1}^nc_mz^m with ∑m∣cm∣2≤Kn−2∑mm2∣cm∣2\sum_m\lvert c_m\rvert^2\le Kn^{-2}\sum_m m^2\lvert c_m\rvert^2, for an absolute constant KK, is LαL^\alpha-flat for any α>0\alpha>0. Its Corollary 3 states that sequences of ±1\pm1 polynomials are not LαL^\alpha-flat for any α>0\alpha>0, and its introduction deduces ∥P∥∞≥(1+d)n\lVert P\rVert_\infty\ge(1+d)\sqrt n for every normalized ±1\pm1 polynomial, which is Problem 1150 answered yes. The preprint presents this as generalizing the author's April 2025 claim (el Abdalaoui 2025).

Depends on. No page of this wiki for the claim itself; the rejection below rests on the accepted OpenAI 2026 page.

Rejection. The accepted Theorem 1.1 of the OpenAI release contradicts the bound directly: for every η>0\eta>0 and every large NN it gives signs with max⁡∣z∣=1∣P(z)∣≤(1+η)N\max_{\lvert z\rvert=1}\lvert P(z)\rvert\le(1+\eta)\sqrt N. Appendix A.2 of the release manuscript (card) shows Theorem 1 false for weighted coefficients, and shows the signed-modulus identity used for Corollary 3 false (P(z)=1+zP(z)=1+z, z=1z=1, z′=iz'=i). Not reviewed; not refereed.