67 citations · 145 across the 21 of their papers we have counts for
6 papers · 1 filter
Avoiding Abelian powers in binary words with bounded Abelian complexity
Julien Cassaigne, Gwénaël Richomme, Kalle Saari +1
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waer…
Abelian Complexity in Minimal Subshifts
Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
In this paper we undertake the general study of the Abelian complexity of an infinite word on a finite alphabet. We investigate both similarities and differences between the Abelia…
On the fixed point of the iterated pseudopalindromic closure
D. Jamet, G. Paquin, G. Richomme +1
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words wit…
Abelian Properties of Words (Extended abstract)
Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
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 Pari…
Balance and Abelian complexity of the Tribonacci word
Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni
G. Rauzy showed that the Tribonacci minimal subshift generated by the morphism is measure-theoretically conjugate to an exchange of thr…
Quasiperiodic and Lyndon episturmian words
Amy Glen, Florence Levé, Gwénaël Richomme
Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we…