CombinatoricsInternational audienceIn a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also infinite Lyndon words. This result raises a natural question: are they the only ones? If no, what do the infinite smooth words that are also Lyndon words look like? In this paper, we give the answer, proving that the only infinite smooth Lyndon words are m(\a ..
AbstractSmooth infinite words over Σ={1,2} are connected to the Kolakoski word K=221121⋯, defined as...
AbstractWe express any general characteristic sturmian word as a unique infinite non-increasing prod...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...
CombinatoricsInternational audienceIn a recent paper, Brlek, Jamet and Paquin showed that some extre...
In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also ...
Abstract. In a recent paper, Brlek et al. showed that some extremal infinite smooth words are also i...
International audienceSmooth words are connected to the Kolakoski sequence. We construct the maximal...
International audienceIn this paper, we consider smooth words over 2-letter alphabets {a, b}, where ...
International audienceGiven a totally ordered alphabet A = {a1 < a2 < < aq}, a Lyndon word is a word...
International audienceIn this article, we consider smooth words over 2-letter alphabets {a, b}, with...
AbstractWe describe some combinatorial properties of an intriguing class of infinite words, called s...
The theorem of Chen-Fox-Lyndon states that every finite word can be uniquely factorized as a nonincr...
International audienceA non-empty word w of {a; b}* is a Lyndon word if and only if it is strictly s...
AbstractWe prove some new combinatorial properties of the set PER of all words w having two periods ...
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n ca...
AbstractSmooth infinite words over Σ={1,2} are connected to the Kolakoski word K=221121⋯, defined as...
AbstractWe express any general characteristic sturmian word as a unique infinite non-increasing prod...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...
CombinatoricsInternational audienceIn a recent paper, Brlek, Jamet and Paquin showed that some extre...
In a recent paper, Brlek, Jamet and Paquin showed that some extremal infinite smooth words are also ...
Abstract. In a recent paper, Brlek et al. showed that some extremal infinite smooth words are also i...
International audienceSmooth words are connected to the Kolakoski sequence. We construct the maximal...
International audienceIn this paper, we consider smooth words over 2-letter alphabets {a, b}, where ...
International audienceGiven a totally ordered alphabet A = {a1 < a2 < < aq}, a Lyndon word is a word...
International audienceIn this article, we consider smooth words over 2-letter alphabets {a, b}, with...
AbstractWe describe some combinatorial properties of an intriguing class of infinite words, called s...
The theorem of Chen-Fox-Lyndon states that every finite word can be uniquely factorized as a nonincr...
International audienceA non-empty word w of {a; b}* is a Lyndon word if and only if it is strictly s...
AbstractWe prove some new combinatorial properties of the set PER of all words w having two periods ...
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n ca...
AbstractSmooth infinite words over Σ={1,2} are connected to the Kolakoski word K=221121⋯, defined as...
AbstractWe express any general characteristic sturmian word as a unique infinite non-increasing prod...
AbstractSome observations on products of primitive words are discussed. By these results, alternativ...