150 citations · 496 across the 43 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
math.CO2009★ 67 cited
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…
math.CO2009★ 1 cited
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…
math.CO2009★ 36 cited
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…