Lyndon pairs and the lexicographically greatest perfect necklace

Verónica Becher, Tomás Tropea

Fix a finite alphabet. A necklace is a circular word. For positive integers $n$ and~$k$, a necklace is $(n,k)$-perfect if all words of length $n$ occur $k$ times but at positions w…