Bergelson–Host–Kra conjecture on monochromatic arithmetic progressions
Let , let , and let or . For a positive integer , write . A length- arithmetic progression in has a common difference . Bergelson–Host–Kra conjecture. There exists an such that for all and every with , there is a for which contains at least distinct arithmetic progressions of length and common difference . The bound is best possible by the random-set heuristic.
References
Status
- Solved: Ben Green and Terence Tao. An arithmetic regularity lemma, an associated counting lemma, and applications (An Irregular Mind: Szemerédi Is 70, Bolyai Society Mathematical Studies 21, 2010) https://terrytao.wordpress.com/2010/02/12/an-arithmetic-regularity-lemma-an-associated-counting-lemma-and-applications/
Source: Matei Mandache, “A Variant of The Corners Theorem”, arXiv:1804.03972 (2018).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.