Abstract : We consider exchange of three intervals with permutation (3, 2, 1). The aim of this paper is to count the cardinality of the set 3iet (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 #2iet(N)/N-3 similar to 1/pi(2) for the number of Sturmian factors allows us to find bounds 1/3 pi(2) +o(1) \textless= #3iet(N)N-4 \textless= 2 pi(2) + o(1)
https://hal.inria.fr/hal-00990493
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s
<>
Soumis le : mardi 13 mai 2014 - 15:39:28
Dernière modification le : vendredi 13 octobre 2017 - 20:08:02
Document(s) archivé(s) le : lundi 10 avril 2017 - 22:22:54
Petr Ambrož, Anna Frid, Zuzana Masáková, Edita Pelantová. On the number of factors in codings of three interval exchange. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2011, Vol. 13 no. 3 (3), pp.51--66. 〈hal-00990493〉
