Simonovits–Sós conjecture for 3-AP-intersecting families
For every , if satisfies that for all , the intersection contains a nonconstant three-term arithmetic progression, i.e. there exist integers and such that , then .
References
- Families that intersect in an arithmetic progression — arXiv — Andrey Kupavskii, Fedor Noskov, Georgy Sokolov, Nikolai Terekhov
Source: arXiv
Progress summary
A new preprint sharply improves the known upper bound, but the conjectured exact answer remains unproved.
The Simonovits–Sós conjecture predicts that a family of subsets whose every pair shares a non-trivial three-term arithmetic progression has size at most . Simonovits and Sós communicated the conjecture; the analogous graph problem was later solved, but this -AP version remains open.
Known results
- The conjectured bound is attained by all subsets containing a fixed three-term arithmetic progression.
- Ellis, Filmus, and Friedgut proved the analogous triangle-intersecting graph conjecture; their methods do not directly settle the -AP problem.
- In 2010, the set-system version was described as widely open.
September–October 2026 progress
On September 16, 2026, Kupavskii, Noskov, Sokolov, and Terekhov proved the first non-trivial bound: for an absolute constant . A later reported result reaches the correct exponential scale for every , but does not determine the exact value. These are preprint results and remain unrefereed.
Current status (as of October 2026): The conjectured exact bound remains open; substantial unrefereed progress gives exponential-scale upper bounds but does not settle the -AP case.
Solutions 0
No solutions have been posted yet.