Bounds on some van der Waerden numbers (Q958741)

For positive integers \(s\) and \(k_1, \dots , k_s\), let \(w(k_1, k_2, \dots , k_s;s)\) denote the minimum integer \(n\) such that for every \(s\)-colouring of the set \(\{1,2, \dots , n\}\) there is an arithmetic progression of length \(k_i\) of colour \(i\), for some \(i\). Let \(w_1(k,m)\) be the least \(n\) such that any 2-colouring of \(\{1, \dots , n\}\) contains either \(k\) consecutive integers of colour 1, or an arithmetic progression of length \(m\) of colour 2. In this well written paper the authors prove: {\parindent=5mm \begin{itemize}\item[1)]For \(k\geq 2\) and some constant \(c>0\): \(w_1(k,4)< e^{k^{c \log k}}\), and \(w(k,4;2)<e^{k^{d \log k}}\), for some \(d>0\). \item[2)]For all \(s\geq 2\) and some positive constant \(d\): \(w(4,4, \dots , 4;s)<e^{s^{d \log s}}\). The proof makes use of a recent upper bound on sets without 4-progressions, due to Green and Tao. \item[3)]For fixed \(k \geq 3, z= \lfloor \log_2 k\rfloor\), there is some \(d>0\) such that for all \(s\) \(w(4,4, \dots , 4;s)> s^{d (\log s)^z}\). The proof makes use of a result of Rankin, generalizing Behrend's construction. \item[4)]Let \(m\geq 3\) be fixed: \(w(k,m;2)> k^{m-1-\frac{1}{\log \log k}}\). The proof of the last result makes use of the Lovász local lemma. \end{itemize}}