Extendability conjecture for finite generalized Lyndon words
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.