Subword complexity and Sturmian colorings of regular trees

Dong Han Kim, Seonhee Lim

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

In this article, we discuss subword complexity of colorings of regular trees. We characterize colorings of bounded subword complexity and study Sturmian colorings, which are colorings of minimal unbounded subword complexity. We classify Sturmian colorings using their type sets. We show that any Sturmian coloring is a lifting of a coloring on a quotient graph of the tree which is a geodesic or a ray, with loops possibly attached, thus a lifting of an 'infinite word'. We further give a complete characterization of the quotient graph for eventually periodic colorings.

Original languageEnglish
Pages (from-to)461-481
Number of pages21
JournalErgodic Theory and Dynamical Systems
Volume35
Issue number2
DOIs
StatePublished - 11 Sep 2015

Fingerprint

Dive into the research topics of 'Subword complexity and Sturmian colorings of regular trees'. Together they form a unique fingerprint.

Cite this