On the number of factors in codings of three interval exchange
| dc.creator | Ambrož, Petr | |
| dc.creator | Frid, Anna | |
| dc.creator | Masáková, Zuzana | |
| dc.creator | Pelantová, Edita | |
| dc.date | 2009-04-15 | |
| dc.date.accessioned | 2026-07-07T13:04:11Z | |
| dc.date.available | 2026-07-07T13:04:11Z | |
| dc.description | We consider exchange of three intervals with permutation $(3,2,1)$. The aim of this paper is to count the cardinality of the set $3\iet(N)$ of all words of length $N$ which appear as factors in infinite words coding such transformations. We use the strong relation of 3iet words and words coding exchange of two intervals, i.e., Sturmian words. The known asymptotic formula $# 2\iet(N)/N^3\sim\frac1{π^2}$ for the number of Sturmian factors allows us to find bounds $\frac1{3π^2} + o(1) \leq # 3\iet(N)/N^4 \leq \frac2{π^2} + o(1)$. | |
| dc.description | 14 pages, 7 figures | |
| dc.identifier | https://arxiv.org/abs/0904.2258 | |
| dc.identifier | http://arxiv.org/abs/0904.2258 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/227074 | |
| dc.subject | Combinatorics | |
| dc.subject | 68R15; 05A16 | |
| dc.title | On the number of factors in codings of three interval exchange | |
| dc.type | text |