Extendability conjecture for finite generalized Lyndon words

Let AA be a finite alphabet, and let ww be a finite generalized Lyndon word over AA. The length of ww is denoted by w|w|. Extendability conjecture. Every finite generalized Lyndon word ww with w2|w|\geq 2 is a prefix of an infinite generalized Lyndon word. The conjecture identifies all finite generalized Lyndon words except the maximum one-letter word as potential prefixes of infinite generalized Lyndon words.

Sources & referencesView supporting material

Primary source

Amanda Burcroff and Eric Winsor, “Generalized Lyndon Factorizations of Infinite Words”, arXiv:1905.04746 (2019).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.