Szemerédi’s theorem with random differences
For fixed and , let be the random subset of obtained by including each integer independently with probability . Determine the threshold for the property that, with high probability as , every set with contains a -term arithmetic progression whose common difference belongs to .
References
- Szemerédi's theorem with random differences and arithmetic Kakeya — arXiv — Gabriel Dahia
Source: arXiv
Progress summary
A new preprint claims a stronger threshold for random differences, but the advance has not been independently verified and the problem remains open.
The problem asks for the threshold at which random allowed differences force arithmetic progressions in every dense set. Earlier work established substantial upper and lower bounds, while a new preprint claims a much stronger upper-bound range.
Known results
- Altman (2019) related the integer threshold to approximation of dual functions by nilsequences and distinguished the finite-field setting.
- Briët and Castro-Silva (2023; revised 2024) proved , improving the preceding bound for odd .
- Their finite-group theorem gives under a coprimality condition.
- A 2025 finite-field result supplied improved lower bounds using analytic-rank and partition-rank estimates.
October 2026 claimed threshold improvement
Gabriel Dahia’s preprint claims to improve the threshold from about to for sufficiently large , using a small-cover lemma and arithmetic-Kakeya constructions. The claim is unverified; the preprint credits GPT 6 Astra only with suggesting a prior construction, not with proving the theorem.
Current status (as of October 2026): Earlier bounds are established, while the claimed improvement remains unverified and the exact threshold problem is open.
Solutions 0
No solutions have been posted yet.