Abelian-square-rich words (Q2358695)

The authors attempt to investigate binary words and their conjecture is that binary words have the largest number of distinct abelian-square factors. This conjecture is well established, while the fundamental topic of the Thue-Morse word is extensively analyzed, and the fact that the Thue-Morse word is uniformly abelian-square-rich is proved. The innovation of the paper is clearly stated. This method represents a conceptual advance over previously published techniques because it can be generalized to some extent, and could be used, for example, to prove that a subclass of fixed points of uniform substitutions is uniformly abelian-square-rich. Moreover, the proof that Sturmian words of bounded exponent are uniformly abelian-square-rich is mainly based on a classical result concerning the discrepancy of the uniformly distributed modulo 1 sequence \((n\alpha)_{n\geq 0}\), where \(\alpha\) is the angle of the Sturmian word. This is most innovative since it is the first application of this result to the theory of Sturmian words, being useful for deriving other results on Sturmian words. The definitions, conjunctures, propositions, lemmas, and theorem, as well as their corresponding proofs, are clearly stated and explained in the paper. Methods are explained and the paper's results are analyzed efficiently.