ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Given 12<μ<1\frac{1}{2}<\mu<1, let a pattern π\pi be μ\mu-forbidden if π∈Allow⁡(T)\pi\in\operatorname{Allow}(T) but π∉Allow⁡(Tμ)\pi\notin\operatorname{Allow}(T_\mu). For n≥3n\geq 3, define

σn=(n−1)n123⋯(n−2).\sigma_n=(n-1)n123\cdots(n-2).

Shortest forbidden-pattern conjecture. The shortest μ\mu-forbidden pattern is of the form σn\sigma_n. Equivalently, if nn is the length of the shortest μ\mu-forbidden pattern, then TμT_\mu avoids σn\sigma_n. Numerical evidence supports this conjecture, motivated by the differing behavior of TμT_\mu and TT near x=1/2x=1/2; 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 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.