Abelian Properties of Words (Extended abstract)

Details Abelian Properties of Words (Extended abstract) Abelian Properties of Words (Extended abstract)

2009-04-19

arxiv.org/abs/0904.2925v1

Mathematics

Combinatorics

12 pages, 1 figure

Scientific paper

We say that two finite words $u$ and $v$ are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian properties of words including abelian complexity, and abelian powers. We study the abelian complexity of the Thue-Morse word and the Tribonacci word, and answer an old question of G. Rauzy by exhibiting a class of words whose abelian complexity is everywhere equal to 3. We also investigate abelian repetitions in words and show that any infinite word with bounded abelian complexity contains abelian $k$-powers for every positive integer $k$.

Affiliated with

Also associated with

No associations

Rating

Abelian Properties of Words (Extended abstract) 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 Properties of Words (Extended abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abelian Properties of Words (Extended abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-329704