Forbidden-substring conjecture for greedy universal cycles
Statement
Let denote the set of strings of length over the alphabet of symbols used in the paper. Let be a string containing a symbol , and let , for some , be the set of strings not containing as a cyclic substring. Forbidden-substring conjecture. The greedy algorithm starting from generates a universal cycle for . This would complete the known partial classification of forbidden substrings for which the greedy algorithm generates a universal cycle; the claim concerns the remaining case in which the forbidden string contains a symbol at most .
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.