Improved lower bounds 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 kb0(k) where b0(k) = c0( k k)1/3. We prove a new lower bound of kb(k) with b(k) = c k k. This is done by modifying Green's argument, replacing a complicated result about random quadratic forms with an elementary probabilistic result.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.