Subword complexity and Sturmian colorings of regular trees

DOI10.1017/etds.2013.50zbMath1309.05073arXiv1212.3064OpenAlexW2108395914MaRDI QIDQ5245330

Dong Han Kim, Seonhee Lim

Publication date: 8 April 2015

Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)

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

zbMATH Keywords

colorings of bounded subword complexity

Mathematics Subject Classification ID

Trees (05C05) Combinatorics on words (68R15) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Tree shift topological entropy ⋮ Quasi-Sturmian colorings on regular trees ⋮ Continued fraction algorithm for Sturmian colorings of trees

Cites Work

• Covering theory for graphs of groups
• Substitutions in dynamics, arithmetics and combinatorics
• Sturmian trees
• Rigidity of commensurators and irreducible lattices
• On commensurator growth
• Topological simplicity, commensurator super-rigidity and nonlinearities of Kac-Moody groups
• Superrigidity for the commensurability group of tree lattices
• Cyclic renormalization and automorphism groups of rooted trees
• Infinite labeled trees: from rational to Sturmian trees
• A First Investigation of Sturmian Trees
• Density of commensurators for uniform lattices of right-angled buildings
• A New Proof for a Metrically Transitive System

This page was built for publication: Subword complexity and Sturmian colorings of regular trees