Counting Abelian Squares

2008/07/31 by Richmond, L. B., Shallit, J. · 3 citations
#05A16 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.0807.5028

Abstract

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.

Cited by

• On the Irreducibility of the Differential Operators Associated to Random Walks in the Standard Euclidean Lattice
• Mutually Abelian-Bordered Binary Words
• Powers of 2 in High-Dimensional Lattice Walks

Related

• Counting Abelian Squares More Efficiently
• Words with the Maximum Number of Abelian Squares
• Solved and unsolved problems about abelian squares
• How many double squares can a string contain?
• On Avoiding Sufficiently Long Abelian Squares