1 citations · 1 across the 4 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
math.CO2008
On a generalization of Christoffel words: epichristoffel words
Genevieve Paquin
Sturmian sequences are well-known as the ones having minimal complexity over a 2-letter alphabet. They are also the balanced sequences over a 2-letter alphabet and the sequences de…
math.CO2008★ 1 cited
Infinite smooth Lyndon words
Genevieve Paquin
In 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…