On the number of factors in codings of three interval exchange

Details On the number of factors in codings of three interval exchange On the number of factors in codings of three interval exchange

2009-04-15

arxiv.org/abs/0904.2258v1

Mathematics

Combinatorics

14 pages, 7 figures

Scientific paper

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{\pi^2}$ for the number of Sturmian factors allows us to find bounds $\frac1{3\pi^2} + o(1) \leq # 3\iet(N)/N^4 \leq \frac2{\pi^2} + o(1)$.

Affiliated with

Also associated with

No associations

Rating

On the number of factors in codings of three interval exchange does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the number of factors in codings of three interval exchange, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the number of factors in codings of three interval exchange will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-591671