Factor-complement partitions of ascending \(k\)-parameter words (Q1356497): Difference between revisions

The authors present another generalization of the Hales-Jewett theorem. In the original Hales-Jewett theorem, words of fixed length over an alphabet, that is 0-parameter subsets, were colored and a monochromatic line, that is a monochromatic 1-parameter subset, was obtained. In the Graham-Rothschild theorem, \(a\)-parameter-subsets were colored and a monochromatic \(b\)-parameter subset was obtained. The authors prove several generalizations and variations of these theorems for ascending parameter words which culminate in a theorem for three-alphabet ascending-parameter words. They give primitive recursive bounds for all these new Ramsey-type numbers.