Quasi-Sturmian colorings on regular trees

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

doi:10.1017/etds.2019.53

Quasi-Sturmian colorings on regular trees

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

Department of Mathematics Education

Seoul National University

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	3403-3419
Number of pages	17
Journal	Ergodic Theory and Dynamical Systems
Volume	40
Issue number	12
DOIs	https://doi.org/10.1017/etds.2019.53
State	Published - 1 Dec 2020

Keywords

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

Access to Document

10.1017/etds.2019.53

Cite this

@article{0f589288372b40d3a0e27304973e9114,

title = "Quasi-Sturmian colorings on regular trees",

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.",

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

author = "Kim, \{Dong Han\} and Lee, \{Seul Bee\} and Seonhee Lim and Deokwon Sim",

note = "Publisher Copyright: {\textcopyright} 2019 Cambridge University Press",

year = "2020",

month = dec,

day = "1",

doi = "10.1017/etds.2019.53",

language = "English",

volume = "40",

pages = "3403--3419",

journal = "Ergodic Theory and Dynamical Systems",

issn = "0143-3857",

publisher = "Cambridge University Press",

number = "12",

}

TY - JOUR

T1 - Quasi-Sturmian colorings on regular trees

AU - Kim, Dong Han

AU - Lee, Seul Bee

AU - Lim, Seonhee

AU - Sim, Deokwon

PY - 2020/12/1

Y1 - 2020/12/1

N2 - 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.

AB - 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.

KW - 05C15

KW - 20E08 (Primary)

KW - 20F65

KW - 37E25

KW - 68R15 (Secondary)

KW - arithmetic and algebraic dynamics

KW - group actions 2010 Mathematics Subject Classification

KW - symbolic dynamics

UR - https://www.scopus.com/pages/publications/85070878198

U2 - 10.1017/etds.2019.53

DO - 10.1017/etds.2019.53

M3 - Article

AN - SCOPUS:85070878198

SN - 0143-3857

VL - 40

SP - 3403

EP - 3419

JO - Ergodic Theory and Dynamical Systems

JF - Ergodic Theory and Dynamical Systems

IS - 12

ER -

Quasi-Sturmian colorings on regular trees

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this