arXiv · 2611.14913
Exact Values and Bounds for Four Color Quadratic Polynomial van der Waerden Numbers
Abstract
For a nonzero polynomial $P(x)\in\mathbb{Z}[x]$ with $P(0)=0$, let $W(P(x);4)$ denote the least integer $N$ such that every four coloring of $[N]$ contains distinct integers $u,v$ of the same color with $v-u=P(d)$ for some integer $d$. The best known general upper bounds for polynomial van der Waerden numbers are primitive recursive but remain enormous compared with the few known exact values. In this paper we determine the exact four color polynomial van der Waerden numbers for \[ \begin{gathered} x^2+x,\quad 2x^2+x,\quad 3x^2+x,\\ x^2+7x,\quad 2x^2+7x,\quad 3x^2+7x,\\ x^2+9x,\quad 2x^2+9x,\quad 3x^2+11x. \end{gathered} \] We derive upper bounds using combinatorial proofs and lower bounds using constructions of explicit colorings of $[N]$ found using the alternative computing inspired method of simulated annealing. More generally, we also prove that the four color polynomial van der Waerden numbers for the entire family of nonzero polynomials $ex^2+fx$ grow only linearly in the magnitude of their coefficients \[ W(ex^2+fx;4)=Θ(|e|+|f|). \]
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ishan Kumthekar, William Gasarch, William Regli, Ian Whitehouse. 2026-11-11. Exact Values and Bounds for Four Color Quadratic Polynomial van der Waerden Numbers. https://searcharxiv.com/abs/2611.14913
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.