Quasi-Sturmian colorings on regular trees

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

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Quasi-Sturmian words, which are infinite words with factor complexity eventually share many properties with Sturmian words. In this article, we study the quasi-Sturmian colorings on regular trees. There are two different types, bounded and unbounded, of quasi-Sturmian colorings. We obtain an induction algorithm similar to Sturmian colorings. We distinguish them by the recurrence function.

Original languageEnglish
Pages (from-to)3403-3419
Number of pages17
JournalErgodic Theory and Dynamical Systems
Volume40
Issue number12
DOIs
StatePublished - 1 Dec 2020

Keywords

  • 05C15
  • 20E08 (Primary)
  • 20F65
  • 37E25
  • 68R15 (Secondary)
  • arithmetic and algebraic dynamics
  • group actions 2010 Mathematics Subject Classification
  • symbolic dynamics

Fingerprint

Dive into the research topics of 'Quasi-Sturmian colorings on regular trees'. Together they form a unique fingerprint.

Cite this