English

New lower bounds for van der Waerden numbers

Combinatorics 2022-06-17 v2 Number Theory

Abstract

We show that there is a red-blue colouring of [N][N] with no blue 3-term arithmetic progression and no red arithmetic progression of length eC(logN)3/4(loglogN)1/4e^{C(\log N)^{3/4}(\log \log N)^{1/4}}. Consequently, the two-colour van der Waerden number w(3,k)w(3,k) is bounded below by kb(k)k^{b(k)}, where b(k)=c(logkloglogk)1/3b(k) = c \big( \frac{\log k}{\log\log k} \big)^{1/3}. Previously it had been speculated, supported by data, that w(3,k)=O(k2)w(3,k) = O(k^2).

Keywords

Cite

@article{arxiv.2102.01543,
  title  = {New lower bounds for van der Waerden numbers},
  author = {Ben Green},
  journal= {arXiv preprint arXiv:2102.01543},
  year   = {2022}
}

Comments

68 pages, accepted for publication in Forum of Math, Pi. Minor changes in the light of referee reports

R2 v1 2026-06-23T22:46:02.643Z