Combinatorial proofs of Infinite versions of the Hales-Jewett theorem
Abstract
We provide new and purely combinatorial proofs of two infinite extensions of the Hales--Jewett theorem. The first one is due to T. Carlson and S. Simpson and the second one is due T. Carlson. Both concern infinite increasing sequences of finite alphabets.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.