67 citations · 109 across the 9 of their papers we have counts for
6 papers · 1 filter
Extremal words in morphic subshifts
James D. Currie, Narad Rampersad, Kalle Saari +1
Given an infinite word X over an alphabet A a letter b occurring in X, and a total order σon A, we call the smallest word with respect to σstarting with b in the shift orbit closur…
Lyndon words and Fibonacci numbers
Kalle Saari
It is a fundamental property of non-letter Lyndon words that they can be expressed as a concatenation of two shorter Lyndon words. This leads to a naive lower bound log_{2}(n)} + 1…
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…
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…