DOE OSTI · 1885347
Counting Abelian Squares More Efficiently
Abstract
I present a recursive formula for calculating the number of abelian squares of length n+n over an alphabet of size d. The presented formula is similar to a previously known formula but has substantially lower complexity when d >> n.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Bennink, Ryan. 2022-03-01. Counting Abelian Squares More Efficiently. https://doi.org/10.2172/1885347. https://searchnasa.com/record/osti%3A1885347/counting-abelian-squares-more-efficiently
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Search NASA by Indiciae: BibTeX · RIS.