Quasi-Sturmian colorings on regular trees
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917617603706880 |
|---|---|
| author | Kim, Dong Han Lee, Seul Bee Lim, Seonhee Sim, Deokwon |
| author_facet | Kim, Dong Han Lee, Seul Bee Lim, Seonhee Sim, Deokwon |
| contents | Quasi-Sturmian words, which are infinite words with factor complexity eventually $n+c$ 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1808_05400 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | Quasi-Sturmian colorings on regular trees Kim, Dong Han Lee, Seul Bee Lim, Seonhee Sim, Deokwon Dynamical Systems Combinatorics Geometric Topology 20E08, 20F65, 05C15, 37E25, 68R15 Quasi-Sturmian words, which are infinite words with factor complexity eventually $n+c$ 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. |
| title | Quasi-Sturmian colorings on regular trees |
| topic | Dynamical Systems Combinatorics Geometric Topology 20E08, 20F65, 05C15, 37E25, 68R15 |
| url | https://arxiv.org/abs/1808.05400 |