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
In this paper, we study the critical exponent of infinite words $\ubeta$ coding $��$-integers for $��$ 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.
24 pages
FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!