English

Abelian-Square-Rich Words

Discrete Mathematics 2017-02-27 v3 Formal Languages and Automata Theory Combinatorics

Abstract

An abelian square is the concatenation of two words that are anagrams of one another. A word of length nn can contain at most Θ(n2)\Theta(n^2) distinct factors, and there exist words of length nn containing Θ(n2)\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 nn grows quadratically with nn. More precisely, we say that an infinite word ww is {\it abelian-square-rich} if, for every nn, every factor of ww of length nn contains, on average, a number of distinct abelian-square factors that is quadratic in nn; and {\it uniformly abelian-square-rich} if every factor of ww 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 2n2n of the Thue-Morse word is 22-regular. As for Sturmian words, we prove that a Sturmian word sα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αs_{\alpha} 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

R2 v1 2026-06-22T17:40:45.089Z