Abelian complexity and Abelian co-decomposition

Details Abelian complexity and Abelian co-decomposition Abelian complexity and Abelian co-decomposition

2012-01-10

arxiv.org/abs/1201.2109v1

Mathematics

Combinatorics

23 pages

Scientific paper

We propose a technique for exploring the abelian complexity of recurrent
infinite words, focusing particularly on infinite words associated with Parry
numbers. Using that technique, we give the affirmative answer to the open
question posed by Richomme, Saari and Zamboni, whether the abelian complexity
of the Tribonacci word attains each value in $\{4,5,6\}$ infinitely many times.

Affiliated with

Also associated with

No associations

Rating

Abelian complexity and Abelian co-decomposition 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 Abelian complexity and Abelian co-decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abelian complexity and Abelian co-decomposition will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463419