On the number of factors in codings of three interval exchange
2011 ◽
Vol Vol. 13 no. 3
(Graph Theory)
◽
Keyword(s):
Graph Theory International audience 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)
2015 ◽
Vol Vol. 17 no. 1
(Graph Theory)
◽
Keyword(s):
2007 ◽
Vol Vol. 9 no. 2
◽
2012 ◽
Vol Vol. 14 no. 2
(Graph Theory)
◽
Keyword(s):
2002 ◽
Vol 12
(01n02)
◽
pp. 371-385
◽
2018 ◽
Vol 29
(05)
◽
pp. 705-720
◽
Keyword(s):
2001 ◽
Vol Vol. 4 no. 2
◽
2020 ◽
Vol DMTCS Proceedings, 28th...
◽
2007 ◽
Vol Vol. 9 no. 2
◽