Recurrent words with constant Abelian complexity

Details Recurrent words with constant Abelian complexity Recurrent words with constant Abelian complexity

2009-11-26

arxiv.org/abs/0911.5151v1

Mathematics

Combinatorics

Scientific paper

We prove the non-existence of recurrent words with constant Abelian
complexity containing 4 or more distinct letters. This answers a question of
Richomme et al.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-194801