Suffix-language characterization conjecture for FKM universal cycles
Statement
Let denote the set of strings of length over the paper's alphabet, and let be closed under rotations. Given a string , an -suffix language is a set of strings such that, whenever belongs to it and , one has and belongs to the set for every . Suffix-language characterization conjecture. The FKM algorithm generates a universal cycle for if and only if the set of necklaces in is an -suffix language, where is the lexicographically maximal necklace in . This proposes a necessary-and-sufficient characterization of the rotation-closed languages for which the FKM algorithm produces a universal cycle.
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.