An Algebraic Proof of the Polynomial Version of van der Waerden's Theorem
Abstract
The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, 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-Cech compactification of an infinite discrete semigroup.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.