Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. There are absolute constants such that for every
where is the least such that every red/blue coloring of has a red three-term or a blue -term arithmetic progression (Schoen states it as a partition of into a set without three-term progressions and a set without -term progressions; the colors are names). This is the second explicit challenge of Problem 721, to prove for some , with Schoen's exponent in the role of the problem's . The theorem is paged at Theorem 1 of the library's source card. The proof adapts the author's method on the structure of large spectra from Schoen's Adv. Math. 2021 paper on Roth's theorem to use the structure of both partition classes. The paper's remark after the theorem notes that the 2020 Bloom--Sisask bound for sets without three-term progressions already implies the same shape with a far smaller .
Covers. The upper-bound challenge: for some constant . It does not cover the lower-bound challenge, met by Green and Hunter on their own claim pages, nor the open-ended request for reasonable bounds, since the true order of magnitude of is open between and the site's .
Depends on. Nothing in this wiki; the result is the paper's own theorem.
Acceptance. Reviewed: the site's curator, T. F. Bloom, labels the problem SOLVED and credits Schoen in the problem's commentary with the first bound of the shape , (page last edited 4 April 2026, accessed 2026-09-18). Refereed: Electron. J. Combin. 28 (2021), no. 2, P2.34, 10 pp., submitted 9 July 2020, accepted 23 May 2021 and published 4 June 2021 (the article's first page). The arXiv preprint 2006.02877v1 of 4 June 2020 is the first posting and names this page. Semantic Scholar's three citing records, include no dispute.
Read depth. Claims checked: Theorem 1 and the remark after it (p. 2); Section 3 (pp. 4--9) for structure only. Nothing is independently reviewed in this corpus.