The four-strand simple pinning hardness conjecture
Statement
Let be a fixed orientable surface. The problem asks whether a simple multiloop with four strands on can be pinned with the specified input bound.
Hardness-starts-at-four conjecture. For a fixed orientable surface , the problem is -complete.
Theorems in the paper establish polynomial-time solvability for at most three strands and -hardness for sufficiently many strands, motivating the conjectured threshold at four strands. The conjecture 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.