New bounds for the Furstenberg-Sárközy theorem
Ben Green, Mehtaab Sawhney
TL;DR
The paper proves a new explicit bound for the Furstenberg–Sárközy problem: there exists $c_0>0$ such that for all $X\ge 10$, any $A\subset [X]$ with no two elements differing by a square satisfies $|A| \le X e^{-c_0 \sqrt{\log X}}$. The authors develop a density-increment framework anchored by a novel arithmetic level-$d$ inequality derived from a global hypercontractivity result of Keller–Lifshitz–Marcus (KLM23) via a lifting construction to product groups; they control square-difference structures using smooth weights on squares and Weyl-type exponential-sum bounds, and translate level-d information into arithmetic-energy bounds $E_{t,k,\vec{\beta}}$, eventually iterating density increments to reach the main bound. A key technical engine is the lifting of functions from $[X]$ to a finite abelian product group $G_{\mathcal{Q}}$ so that hypercontractive estimates can be applied through derivative-global analysis. The work also discusses intrinsic limitations of the density-increment approach, constructing a barrier to strictly faster than quasi-polynomial improvements within this framework. Overall, the results sharpen the quantitative understanding of Furstenberg–Sárközy-type problems and provide a flexible method potentially adaptable to broader polynomial difference settings.
Abstract
Suppose that $A \subset \{1,\dots, N\}$ has no two elements differing by a square. Then $|A| \ll N e^{-c\sqrt{\log N}}$.
