Improved lower bounds for van der Waerden numbers

TL;DR

This paper improves the lower bounds for two-color van der Waerden numbers by refining Green's argument and replacing complex results with simpler probabilistic methods, resulting in a stronger growth rate bound.

Contribution

It presents a new lower bound for van der Waerden numbers, enhancing previous results by simplifying the proof and achieving a larger exponent in the bound.

Findings

New lower bound of $k^{b(k)}$ with $b(k) = \frac{c\log k}{\log \log k}$

Modified Green's argument using elementary probabilistic results

Improved growth rate for van der Waerden numbers

Abstract

Recently, Ben Green proved that the two-color van der Waerden number $w(3,k)$ is bounded from below by $k^{b_0(k)}$ where $b_0(k) = c_0\left(\frac{\log k }{\log \log k}\right)^{1/3}$. We prove a new lower bound of $k^{b(k)}$ with $b(k) = \frac{c\log k}{\log \log k}$. This is done by modifying Green's argument, replacing a complicated result about random quadratic forms with an elementary probabilistic result.