English

A subexponential upper bound for van der Waerden numbers W(3,k)

Combinatorics 2020-06-05 v1 Number Theory

Abstract

We show an improved upper estimate for van der Waerden number W(3,k):W(3,k): there is an absolute constant c>0c>0 such that if {1,,N}=XY\{1,\dots,N\}=X\cup Y is a partition such that XX does not contain any arithmetic progression of length 33 and YY does not contain any arithmetic progression of length kk then Nexp(O(k1c)).N\le \exp(O(k^{1-c}))\,.

Keywords

Cite

@article{arxiv.2006.02877,
  title  = {A subexponential upper bound for van der Waerden numbers W(3,k)},
  author = {Tomasz Schoen},
  journal= {arXiv preprint arXiv:2006.02877},
  year   = {2020}
}
R2 v1 2026-06-23T16:03:28.462Z