Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2026_07_15_snyder: For fixed epsilon in (0,1), under the reading that the bound must hold for every translate x, the least window length is of exact order n: an explicit linear length suffices and no shorter order does; a Lean project is supplied.
Linked from (1)
Graph