Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Theorem 1.1 of Kelley and Meka, Strong Bounds for 3-Progressions, states that there is an absolute constant such that every with no non-trivial three-term arithmetic progression has density at most , that is,
for some and all large , where is the largest size of such a set. The quantitative form is Theorem 1.2: a set of density at least has at least solutions of , so can be taken as . The result page Theorem 1.1 records both statements. Since the factor tends to zero, the bound gives , the instance of Problem 139, first proved by Roth in 1953, with a rate the problem does not ask for. The same theorem is the accepted full claim of Problem 140, recorded on its claim page there.
Covers. The instance of the statement, , which Szemerédi's accepted full claim already settles; the page records the bound's rate, which no claim of this problem requires. Nothing about any .
Depends on. Nothing in this wiki; the theorem is the paper's own.
Acceptance. Reviewed: Bloom and Sisask, two named experts on the problem,
re-derived the full argument in their refereed exposition The Kelley--Meka
bounds for sets free of three-term arithmetic progressions, Essential Number
Theory 2 (2023), no. 1, 15--44, doi:10.2140/ent.2023.2.15, and then sharpened
the exponent to in arXiv:2309.02353, which has
its own claim page.
The site's curator labels the problem proved on Szemerédi's theorem and cites
this paper in the commentary only as the best known bound for , which
credits the bound and not a settlement of this problem; the curator's
acceptance of the same theorem as the proof of Problem 140 is recorded on
that problem's claim page. Not refereed: the paper appeared in the
proceedings of the 2023 IEEE 64th Annual Symposium on Foundations of Computer
Science (FOCS 2023), pp. 933--973, doi:10.1109/FOCS57990.2023.00059, a
conference proceedings and not a journal, and no journal version is recorded
(Crossref, 2026-09-18), so refereed is not listed. The proof is not checked
here.