6533b7dcfe1ef96bd1272b2f
RESEARCH PRODUCT
Abelian-Square-Rich Words
Gabriele FiciFilippo MignosiJeffrey Shallitsubject
FOS: Computer and information sciencesGeneral Computer ScienceDiscrete Mathematics (cs.DM)Formal Languages and Automata Theory (cs.FL)Abelian squareComputer Science - Formal Languages and Automata Theory0102 computer and information sciences02 engineering and technology68R1501 natural sciencesSquare (algebra)Theoretical Computer ScienceCombinatorics0202 electrical engineering electronic engineering information engineeringFOS: MathematicsMathematics - CombinatoricsAbelian groupQuotientMathematicsDiscrete mathematicsComputer Science (all)Sturmian wordSturmian wordFunction (mathematics)Thue–Morse word010201 computation theory & mathematicsBounded functionThue-Morse wordExponentAbelian square; Sturmian word; Thue-Morse word; Theoretical Computer Science; Computer Science (all)020201 artificial intelligence & image processingCombinatorics (math.CO)Word (group theory)Computer Science::Formal Languages and Automata TheoryComputer Science - Discrete Mathematicsdescription
An abelian square is the concatenation of two words that are anagrams of one another. A word of length $n$ can contain at most $\Theta(n^2)$ distinct factors, and there exist words of length $n$ containing $\Theta(n^2)$ distinct abelian-square factors, that is, distinct factors that are abelian squares. This motivates us to study infinite words such that the number of distinct abelian-square factors of length $n$ grows quadratically with $n$. More precisely, we say that an infinite word $w$ is {\it abelian-square-rich} if, for every $n$, every factor of $w$ of length $n$ contains, on average, a number of distinct abelian-square factors that is quadratic in $n$; and {\it uniformly abelian-square-rich} if every factor of $w$ contains a number of distinct abelian-square factors that is proportional to the square of its length. Of course, if a word is uniformly abelian-square-rich, then it is abelian-square-rich, but we show that the converse is not true in general. We prove that the Thue-Morse word is uniformly abelian-square-rich and that the function counting the number of distinct abelian-square factors of length $2n$ of the Thue-Morse word is $2$-regular. As for Sturmian words, we prove that a Sturmian word $s_{\alpha}$ of angle $\alpha$ is uniformly abelian-square-rich if and only if the irrational $\alpha$ has bounded partial quotients, that is, if and only if $s_{\alpha}$ has bounded exponent.
year | journal | country | edition | language |
---|---|---|---|---|
2017-01-04 |