Coloring factors of substitutive infinite words

DOI10.1016/j.disc.2016.09.013zbMath1351.05220arXiv1605.09343OpenAlexW2963640332MaRDI QIDQ729779

Rui Pacheco, Manuel Silva, André Bernardino

Publication date: 22 December 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theorycombinatorics on wordsrecognizabilitysubstitutive words

Mathematics Subject Classification ID

Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10) Ramsey theory (05D10)

Related Items (2)

MONOCHROMATIC FACTORIZATIONS OF WORDS AND PERIODICITY ⋮ Coloring Problems for Infinite Words

Cites Work

• Two combinatorial properties of partitions of the free semigroup into finitely many parts
• On prefixal factorizations of words
• Substitution dynamical systems - spectral analysis
• Strongly non-repetitive sequences and progression-free sets
• A coloring problem for infinite words
• Characterization of the repetitive commutative semigroups
• Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
• Reconnaissabilité des substitutions et complexité des suites automatiques
• Minimal flows arising from substitutions of non-constant length

This page was built for publication: Coloring factors of substitutive infinite words