Quasi-Sturmian colorings on regular trees
Dynamical Systems
2024-03-20 v1 Combinatorics
Geometric Topology
Abstract
Quasi-Sturmian words, which are infinite words with factor complexity eventually share many properties with Sturmian words. In this paper, 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
Cite
@article{arxiv.1808.05400,
title = {Quasi-Sturmian colorings on regular trees},
author = {Dong Han Kim and Seul Bee Lee and Seonhee Lim and Deokwon Sim},
journal= {arXiv preprint arXiv:1808.05400},
year = {2024}
}
Comments
22 pages, 6 figures