On the number of factors in codings of three interval exchange

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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)$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-591671

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.