Abelian-Square-Rich Words
Abstract
An abelian square is the concatenation of two words that are anagrams of one another. A word of length can contain at most distinct factors, and there exist words of length containing 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 grows quadratically with . More precisely, we say that an infinite word is {\it abelian-square-rich} if, for every , every factor of of length contains, on average, a number of distinct abelian-square factors that is quadratic in ; and {\it uniformly abelian-square-rich} if every factor of 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 of the Thue-Morse word is -regular. As for Sturmian words, we prove that a Sturmian word of angle is uniformly abelian-square-rich if and only if the irrational has bounded partial quotients, that is, if and only if has bounded exponent.
Cite
@article{arxiv.1701.00948,
title = {Abelian-Square-Rich Words},
author = {Gabriele Fici and Filippo Mignosi and Jeffrey Shallit},
journal= {arXiv preprint arXiv:1701.00948},
year = {2017}
}
Comments
To appear in Theoretical Computer Science. Corrected a flaw in the proof of Proposition 7