On colorings of variable words

DOI10.1016/J.DISC.2015.01.031MaRDI QIDQ2407037zbMATH OpenOpenAlexFDO

Authors Konstantinos Tyros

Publication date 28 September 2017

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1409.1471

zbMATH Keywords

Ramsey theoryHales-Jewett theoremvariable wordsGraham-Rothschild theorem

Mathematics Subject Classification ID

Ramsey theory (05D10)

Abstract: In this note, we prove that the base case of the Graham--Rothschild Theorem, i.e., the one that considers colorings of the ($1$-dimensional) variable words, admits bounds in the class $mathcal{E}^5$ of Grzegorczyk's hierarchy.

Recommendations

• Partitions of factorisations of parameter words
• Partition Theorems for Spaces of Variable Words
• scientific article; zbMATH DE number 3873610
• A Sparse Graham-Rothschild Theorem
• The Graham-Rothschild theorem and the algebra of \(\beta W\).

Cites work

• A simple proof of the density Hales-Jewett theorem
• Bounds for the disjoint unions theorem
• Bounds on trees
• Combinatorial Theorems on Classifications of Subsets of a Given Set
• Finite sums from sequences within cells of a partition of N
• Primitive Recursive Bounds for Van Der Waerden Numbers
• Ramsey theory for product spaces
• Ramsey's Theorem for n-Parameter Sets
• Regularity and Positional Games

Cited in

(2)

• Coloring factors of substitutive infinite words
• A structure theorem for stochastic processes indexed by the discrete hypercube

This page was built for publication: On colorings of variable words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407037)