Improving the Use of Cyclic Zippers in Finding Lower Bounds for van der Waerden Numbers

[摘要] For integers $k$ and $l$, each greater than $1$, suppose that $p$ is a prime with $p\equiv1\,(\textrm{mod}\, k)$ and that the $k^{\rm th}$-power classes $\textrm{mod}\, p$ induce a coloring of the integer segment $[0,\, p-1]$ that admits no monochromatic

[学科分类] 离散数学和组合数学

[关键词] van der Waerden numbers