2nd Lyndex meeting

The second Lyndex meeting takes place in Caen, and online, on Dec. 17th 2024.
Our invited speaker is Gabriele Fici from the University of Palermo.

Universal Lyndon Words

A word w over an alphabet Σ is a Lyndon word if there exists an order defined on Σ for which w is lexicographically smaller than all of its conjugates. A universal Lyndon word of degree n is a word over an n-letter alphabet that has length n! and such that all of its conjugates are Lyndon words. We show that universal Lyndon words exist of any degree and exhibit combinatorial properties of these words. We then define particular prefix codes, that we call Hamiltonian lex-codes, and show that every Hamiltonian lex-code is in bijection with the set of the shortest unrepeated prefixes of the conjugates of a universal Lyndon word. This allows us to give an algorithm for constructing all the universal Lyndon words of any degree.
This second Lyndex meeting has been supported by the NormaSTIC federation.

1st Lyndex meeting

The first Lyndex meeting took place in Rouen on Dec. 14th 2023. We have been honored by the participation of Pr. J.-P. Duval. During this preliminary day to the Lyndex project, three talks have been given. You can find the slides here. This first Lyndex meeting has been supported by the NormaSTIC federation and by the Theoretical Computer Science Seminar of the University of Rouen-Normandie.