Strongly k-Abelian Repetitions
We consider with a new point of view the notion of nth powers in connection with the k-abelian equivalence of words. For a fixed natural number k, words u and v are k-abelian equivalent if every factor of length at most k occurs in u as many times as in v. The usual abelian equivalence coincides with 1-abelian equivalence. Usually k-abelian squares are defined as words w for which there exist non-empty k-abelian equivalent words u and v such that w = uv. The new way to consider k-abelian nth powers is to say that a word is strongly k-abelian nth power if it is k-abelian equivalent to an nth power. We prove that strongly k-abelian nth powers are not avoidable on any alphabet for any numbers k and n. In the abelian case this is easy, but for k > 1 the proof is not trivial.
Keywordsk-abelian equivalence nth powers avoidability
Unable to display preview. Download preview PDF.
- 5.Huova, M., Karhumäki, J.: On the unavoidability of k-abelian squares in pure morphic words. Journal of Integer Sequences 16, article 13.2.9 (2013)Google Scholar
- 6.Huova, M.: Existence of an infinite ternary 64-abelian square-free word. Special Issue of the Journal RAIRO - Theoretical Informatics and Applications dedicated to “Journees Montoises d’Informatique Theorique 2012” (submitted)Google Scholar
- 7.Karhumäki, J., Saarela, A., Zamboni, L.: On a generalization of Abelian equivalence and complexity of infinite words (submitted), arXiv preprint at http://arxiv.org/abs/1301.5104
- 9.Lothaire, M.: Combinatorics on words. Addison-Wesley, Reading (1983)Google Scholar
- 12.Thue, A.: Über unendliche Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 7, 1–22 (1906)Google Scholar
- 13.Thue, A.: Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske vid. Selsk. Skr. Mat. Nat. Kl. 1, 1–67 (1912)Google Scholar