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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.