2000 character limit reached
Words with the Maximum Number of Abelian Squares
Published 11 Jun 2015 in cs.DM, cs.FL, and math.CO | (1506.03562v1)
Abstract: An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain $\Theta(n2)$ distinct factors that are abelian squares. We study infinite words such that the number of abelian square factors of length $n$ grows quadratically with $n$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.