The doubled-prefix conjecture for reduced banned words
Statement
Let be a scaling factor, and let be the reduced banned words, enumerated in nondecreasing order of length, with . For each , write
A doubled-prefix conjecture asserts that, for every , the concatenation does not contain any with as a subword.
This condition is intended to support the observed recursive pattern in the reduced banned words and the converse of the sufficient condition for an iterated function system to be of finite type. The source says that proving the assertion or finding a counterexample is very difficult; the supplied status evidence marks it as disproved, although no explicit counterexample is provided here.
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.