An Algebraic Proof of the Polynomial Version of van der Waerden's Theorem
The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, \cite{Bergelson1996}, significantly highlighted the role of dynamical systems in addressing problems related to monochromatic configurations within algebraic structures. In this paper, by introducing symbolic polynomials, we aim to provide an alternative proof of the polynomial version of van der Waerden's theorem relying solely on Stone-Čech compactification of an infinite discrete semigroup.
math.CO↗