Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.