Counting Abelian Squares

Simple item page
dc.creatorRichmond, L. B.
dc.creatorShallit, J.
dc.date2008-07-31
dc.date.accessioned2026-07-07T09:53:59Z
dc.date.available2026-07-07T09:53:59Z
dc.descriptionAn 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.
dc.descriptiondraft
dc.identifierhttps://arxiv.org/abs/0807.5028
dc.identifierhttp://arxiv.org/abs/0807.5028
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/166149
dc.subjectCombinatorics
dc.subject05A16
dc.titleCounting Abelian Squares
dc.typetext

Files

Collections

arXiv