Quasi-Sturmian colorings on regular trees

DOI10.1017/etds.2019.53OpenAlexW2967457581WikidataQ127405879 ScholiaQ127405879MaRDI QIDQ5131222

Deokwon Sim, Dong Han Kim, Seul Bee Lee, Seonhee Lim

Publication date: 4 November 2020

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

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

zbMATH Keywords

group actionssymbolic dynamicsarithmetic and algebraic dynamics

Mathematics Subject Classification ID

Combinatorics on words (68R15) Geometric group theory (20F65) Coloring of graphs and hypergraphs (05C15) Dynamical systems involving maps of trees and graphs (37E25) Groups acting on trees (20E08)

Related Items (1)

Diophantine approximation on conics

Cites Work

• Unnamed Item
• Unnamed Item
• Substitutions in dynamics, arithmetics and combinatorics
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
• Sequences with minimal block growth II
• Minimal symbolic flows having minimal block growth
• Automatic Sequences
• Continued fraction algorithm for Sturmian colorings of trees
• Subword complexity and Sturmian colorings of regular trees

This page was built for publication: Quasi-Sturmian colorings on regular trees