Wiki
Wiki

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

Updated


Claim. For a Littlewood polynomial fn(x)=∑k=0nϵkxkf_n(x)=\sum_{k=0}^n\epsilon_kx^k with independent Rademacher signs, write ∥fn∥∞=max⁡x∈[−1,1]∣fn(x)∣\lVert f_n\rVert_\infty=\max_{x\in[-1,1]}\lvert f_n(x)\rvert. Theorem 1.1: let BB be a standard Brownian motion and, for δ>0\delta>0,

F(δ)=P(sup⁡t≥0∣∫01e−st dBs∣≤δ);F(\delta)=\mathbb P\Bigl(\sup_{t\ge0}\Bigl\lvert\int_0^1e^{-st}\,dB_s\Bigr\rvert\le\delta\Bigr);

then FF is continuous and strictly increasing on (0,∞)(0,\infty) and almost surely

lim inf⁡n→∞∥fn∥∞n F−1(log⁡−1/2n)=1.\liminf_{n\to\infty}\frac{\lVert f_n\rVert_\infty}{\sqrt n\,F^{-1}(\log^{-1/2}n)}=1 .

Theorem 1.2: for δ∈(0,1/4)\delta\in(0,1/4), log⁡F(δ)=−23π2log⁡3(1/δ)+o(log⁡3(1/δ))\log F(\delta)=-\frac{2}{3\pi^2}\log^3(1/\delta)+o(\log^3(1/\delta)). The two theorems give the statement of the abstract: almost surely

lim inf⁡n→∞log⁡(∥fn∥∞/n)(log⁡log⁡n)1/3=−(3π24)1/3.\liminf_{n\to\infty}\frac{\log\bigl(\lVert f_n\rVert_\infty/\sqrt n\bigr)}{(\log\log n)^{1/3}} =-\Bigl(\frac{3\pi^2}{4}\Bigr)^{1/3}.

For almost every tt the signs (−1)ϵk(t)(-1)^{\epsilon_k(t)} of Problem 524 are independent Rademacher variables, and the paper's sum starts at k=0k=0 where the problem's starts at k=1k=1, which changes the maximum by at most 11, so the result is a statement about Mn(t)M_n(t). The introduction recalls Salem and Zygmund's upper envelope, lim sup⁡n∥fn∥∞/nlog⁡log⁡n=2\limsup_n\lVert f_n\rVert_\infty/\sqrt{n\log\log n}=\sqrt2 almost surely [SaZy54, Theorem (6.1.1)], and presents the lower envelope as the question raised there and reiterated by Erdős in his 1961 problem paper [Er61], which is this problem's source. Together the two envelopes determine the almost sure behavior of Mn(t)M_n(t) that the problem asks for, so the claim is recorded as answered. The proof sandwiches the small-ball event of the Gaussian process between two L2L^2 events treated by spectral methods and reduces the polynomial to the Gaussian model by a strong approximation; the paper's acknowledgments say that ChatGPT Pro drew the authors' attention to the Gaussian inequality used in Proposition 4.1 and that ChatGPT Codex was used to help write the manuscript. The source card is Letwin and Sawhney 2026.

Depends on. No page of this wiki.

Standing. Claimed. The paper is an arXiv preprint (v1 submitted 2026-04-21), not refereed and not registered on the site's proof-claims tab; Nat Sothanaphan announced it on the thread on 2026-04-24. On 2026-01-30 Sawhney had written on the thread that Sawhney and Letwin could prove a result stronger than the note on Chojecki 2026 by determining the constant in the Gao–Li–Wellner small-ball asymptotic, and that neither result pins the answer down as precisely as Salem and Zygmund might have wanted. The site labels the problem OPEN (page last edited 27 December 2025, before these postings). Nothing is compiled or reviewed in this wiki.