ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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 ∣w∣≥2|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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.