Factor-complement partitions of ascending k-parameter words
Factor-complement partitions of ascending \(k\)-parameter words
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.
- Reading ``A variant of the Hales-Jewett theorem on its anniversary
- Graham-Rothschild parameter words and measurable partitions
- Partition theorems for factorizations of ascending parameter words
- Combining extensions of the Hales-Jewett theorem with Ramsey theory in other structures
- Partial words and the critical factorization theorem revisited
- An infinitary extension of the Graham–Rothschild Parameter Sets Theorem
- A Sparse Graham-Rothschild Theorem
- Partitions of factorisations of parameter words
This page was built for publication: Factor-complement partitions of ascending \(k\)-parameter words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1356497)