Counting Abelian Squares

Details Counting Abelian Squares Counting Abelian Squares

2008-07-31

arxiv.org/abs/0807.5028v1

Mathematics

Combinatorics

draft

Scientific paper

An abelian square is a string of length 2n where the last n symbols form a
permutation of the first n symbols. In this note we count the number of abelian
squares and give an asymptotic estimate of this quantity.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-363516