Binary words are conjectured to contain at least floor(n/4) abelian squares, with the bound proven in special cases and candidate minimal words constructed for every Parikh vector.
”Solved and unsolved problems about abelian squares.” arXiv preprint arXiv:1802.04481 (2018)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Binary Words Containing Few Abelian Squares
Binary words are conjectured to contain at least floor(n/4) abelian squares, with the bound proven in special cases and candidate minimal words constructed for every Parikh vector.