Extendability conjecture for finite generalized Lyndon words
Extendability conjecture for finite generalized Lyndon words
Let be a finite alphabet, and let be a finite generalized Lyndon word over . The length of is denoted by . Extendability conjecture. Every finite generalized Lyndon word with 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.