Coloring Problems for Infinite Words
From MaRDI portal
Publication:4613550
DOI10.1007/978-3-319-69152-7_6zbMath1405.05005OpenAlexW4242128298MaRDI QIDQ4613550
Publication date: 24 January 2019
Published in: Trends in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-69152-7_6
Related Items (3)
A Ramsey characterisation of eventually periodic words ⋮ Monochromatic arithmetic progressions in automatic sequences with group structure ⋮ Monochromatic arithmetic progressions in binary Thue-Morse-like words
Cites Work
- Unnamed Item
- Unnamed Item
- Category theory of symbolic dynamics
- Algebra in the Stone-Čech compactification. Theory and applications
- Coloring factors of substitutive infinite words
- On some variations of coloring problems of infinite words
- On prefixal factorizations of words
- Partitions and sums of integers with repetition
- Ramsey's theorem with sums or unions
- A canonical partition relation for finite subsets of \(\omega\)
- Pairwise sums in colourings of the reals
- Finite sums from sequences within cells of a partition of N
- A short proof of Hindman's theorem
- A coloring problem for infinite words
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Automatic Sequences
- MONOCHROMATIC FACTORIZATIONS OF WORDS AND PERIODICITY
This page was built for publication: Coloring Problems for Infinite Words