Combinatorial proofs of Infinite versions of the Hales-Jewett theorem
classification
🧮 math.CO
keywords
infinitecarlsoncombinatorialproofstheoremalphabetsconcernextensions
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.