论文标题
计算阿贝里安正方形的效率更高
Counting Abelian Squares More Efficiently
论文作者
论文摘要
我提出了一个递归公式，用于计算大小$ d $的字母上的长度为$ n+n $的阿贝利亚广场的数量。提出的公式类似于先前已知的公式，但当$ d \ gg n $时，复杂性大大降低。
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\gg n$.
