2022/03/22 by Ryan S. Bennink, Bennink, Ryan S.
Biochemistry, Genetics and Molecular Biology · Computer Science · #05-08 #Algorithms and Data Compression #Cellular Automata and Applications #Combinatorics (math.CO) #DNA and Biological Computing #FOS: Mathematics #G.2.1
paper · pdf · doi:10.48550/arxiv.2203.11886
openalex publication_date 2022/03/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.