Counting Abelian Squares
Combinatorics
2008-08-01 v1
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.
Cite
@article{arxiv.0807.5028,
title = {Counting Abelian Squares},
author = {L. B. Richmond and J. Shallit},
journal= {arXiv preprint arXiv:0807.5028},
year = {2008}
}
Comments
draft