← All problems

Bergelson–Host–Kra conjecture on monochromatic arithmetic progressions

7 years old · documented by

Let 0<α<10<\alpha<1, let ϵ>0\epsilon>0, and let k=3k=3 or 44. For a positive integer NN, write [N]={1,2,…,N}[N]=\{1,2,\dots,N\}. A length-kk arithmetic progression in [N][N] has a common difference d≠0d\neq 0. Bergelson–Host–Kra conjecture. There exists an N0N_0 such that for all N≥N0N\geq N_0 and every A⊂[N]A\subset[N] with ∣A∣≥αN|A|\geq\alpha N, there is a d≠0d\neq 0 for which AA contains at least (αk−ϵ)N(\alpha^k-\epsilon)N distinct arithmetic progressions of length kk and common difference dd. The bound is best possible by the random-set heuristic.

References

Status

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.