Abelian Properties of Words (Extended abstract)
From MaRDI portal
Publication:6213596
arXiv0904.2925MaRDI QIDQ6213596FDOQ6213596
Kalle Saari, Gwénaël Richomme, Luca Q. Zamboni
Publication date: 19 April 2009
Abstract: We say that two finite words and are abelian equivalent if and only if they have the same number of occurrences of each letter, or equivalently if they define the same Parikh vector. In this paper we investigate various abelian properties of words including abelian complexity, and abelian powers. We study the abelian complexity of the Thue-Morse word and the Tribonacci word, and answer an old question of G. Rauzy by exhibiting a class of words whose abelian complexity is everywhere equal to 3. We also investigate abelian repetitions in words and show that any infinite word with bounded abelian complexity contains abelian -powers for every positive integer .
This page was built for publication: Abelian Properties of Words (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6213596)
