ProbXiv
Explorersign in
Problem archiveProblem record

Statement

A knot diagram represents a knot, and its unknotting number is the minimum number of crossing changes required to transform it into the unknot. The associated decision problem asks, given a knot diagram and an integer nn, whether the knot has unknotting number nn.

Unknotting-number conjecture. The \textsc{unknotting number} problem is NP-hard.

The conjecture asserts computational hardness for a natural knot-theoretic decision problem. The source explains that proving this is difficult because unknotting numbers are known for only a few specific classes of knots, making it hard to rule out unexpected unknotting operations in reductions from 33-SAT.

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.