On colorings of variable words
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 E5 of Grzegorczyk's hierarchy.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.