Counting Abelian Squares
classification
🧮 math.CO
keywords
abeliansquaressymbolsasymptoticcountcountingestimatefirst
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.