Words with the Maximum Number of Abelian Squares
Gabriele Fici, Filippo Mignosi

TL;DR
This paper investigates infinite words where the count of abelian square factors of length n grows quadratically, exploring the combinatorial properties and maximum occurrences of such structures.
Contribution
It introduces new insights into the growth rate of abelian square factors in infinite words, highlighting conditions for quadratic growth.
Findings
Number of abelian square factors can grow quadratically with word length
Infinite words can be constructed with maximal abelian square occurrences
Provides bounds and characterizations for abelian square distributions
Abstract
An abelian square is the concatenation of two words that are anagrams of one another. A word of length can contain distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length grows quadratically with .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
