ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Σ\Sigma be a fixed orientable surface. The problem SimplePin(Σ,4)\mathsf{SimplePin}(\Sigma,4) asks whether a simple multiloop with four strands on Σ\Sigma can be pinned with the specified input bound.

Hardness-starts-at-four conjecture. For a fixed orientable surface Σ\Sigma, the problem SimplePin(Σ,4)\mathsf{SimplePin}(\Sigma,4) is NP\textsf{NP}-complete.

Theorems in the paper establish polynomial-time solvability for at most three strands and NP\textsf{NP}-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 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.