Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_01_30_chojecki: Chojecki's note, written with GPT 5.2, reproves the Salem–Zygmund upper envelope of M_n(t) and finds the scale of its smallest values along a sparse subsequence; it does not determine the lower envelope.
2026_04_21_letwin_sawhney: Letwin and Sawhney prove that almost surely the lower envelope of the maximum of a random Littlewood polynomial on [-1,1] is sqrt(n) times exp(-(3 pi^2/4)^{1/3} (log log n)^{1/3}) to first order in the exponent.
Linked from (1)
Graph