Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers

Details Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers

2010-07-16

arxiv.org/abs/1007.2724v1

Mathematics

Combinatorics

24 pages

Scientific paper

In this paper, we study the critical exponent of infinite words $\ubeta$ coding $\beta$-integers for $\beta$ being a~non-simple Parry number. In other words, we investigate the maximal consecutive repetitions of factors that occur in the infinite word in question. We calculate also the ultimate critical exponent that expresses how long repetitions occur in the infinite word $\ubeta$ when the factors of length growing ad infinitum are considered. The basic ingredients of our method are the description of all bispecial factors of $\ubeta$ and the notion of return words. This method can be applied to any fixed point of any primitive substitution.

Affiliated with

Also associated with

No associations

Rating

Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers 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 Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Critical exponent of infinite words coding beta-integers associated with non-simple Parry numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-50791