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.

arXiv comment18pages, no figures

Cited by in corpus (1)

• A Combinatorial proof of an Infinite version of the Hales-Jewett theorem