Improved lower bounds for van der Waerden numbers

preprint2022arXivOpen access

Abstract

Recently, Ben Green proved that the two-color van der Waerden number w(3,k)w(3,k) is bounded from below by kb0(k)k^{b_0(k)} where b0(k)=c0(log⁡klog⁡log⁡k)1/3b_0(k) = c_0\left(\frac{\log k }{\log \log k}\right)^{1/3}. We prove a new lower bound of kb(k)k^{b(k)} with b(k)=clog⁡klog⁡log⁡kb(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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.