Geodesic
Counting abelian squares
The electronic journal of combinatorics, Tome 16 (2009) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

An abelian square is a nonempty string of length $2n$ where the last $n$ symbols form a permutation of the first $n$ symbols. Similarly, an abelian $r$'th power is a concatenation of $r$ blocks, each of length $n$, where each block is a permutation of the first $n$ symbols. In this note we point out that some familiar combinatorial identities can be interpreted in terms of abelian powers. We count the number of abelian squares and give an asymptotic estimate of this quantity.
DOI : 10.37236/161
Classification : 68R15, 05A16
Mots-clés : abelian powers 
@article{10_37236_161,
     author = {L. B. Richmond and Jeffrey Shallit},
     title = {Counting abelian squares},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/161},
     zbl = {1191.68479},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/161/}
}
TY  - JOUR
AU  - L. B. Richmond
AU  - Jeffrey Shallit
TI  - Counting abelian squares
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/161/
DO  - 10.37236/161
ID  - 10_37236_161
ER  - 
%0 Journal Article
%A L. B. Richmond
%A Jeffrey Shallit
%T Counting abelian squares
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/161/
%R 10.37236/161
%F 10_37236_161
L. B. Richmond; Jeffrey Shallit. Counting abelian squares. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/161

Cité par Sources :