Skip to Main content Skip to Navigation
Journal articles

On the number of factors in codings of three interval exchange

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)
Document type :
Journal articles
Complete list of metadata

Cited literature [23 references]  Display  Hide  Download

https://hal.inria.fr/hal-00990493
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Tuesday, May 13, 2014 - 3:39:28 PM
Last modification on : Tuesday, January 19, 2021 - 10:16:03 AM
Long-term archiving on: : Monday, April 10, 2017 - 10:22:54 PM

File

1309-6570-1-PB.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00990493, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

109

Files downloads

1604