Shortest forbidden-pattern conjecture for symmetric tent maps
Statement
Given , let a pattern be -forbidden if but . For , define
Shortest forbidden-pattern conjecture. The shortest -forbidden pattern is of the form . Equivalently, if is the length of the shortest -forbidden pattern, then avoids . Numerical evidence supports this conjecture, motivated by the differing behavior of and near ; the claim remains open.
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.