2000 character limit reached
A subexponential upper bound for van der Waerden numbers W(3,k)
Published 4 Jun 2020 in math.CO and math.NT | (2006.02877v1)
Abstract: We show an improved upper estimate for van der Waerden number $W(3,k):$ there is an absolute constant $c>0$ such that if ${1,\dots,N}=X\cup Y$ is a partition such that $X$ does not contain any arithmetic progression of length $3$ and $Y$ does not contain any arithmetic progression of length $k$ then $$N\le \exp(O(k{1-c}))\,.$$
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.