The Computational Complexity of Knot and Link Problems

Joel Hass; Jeffrey C. Lagarias; Nicholas Pippenger

Home/Archive/arXiv

arXiv · math/9807016

The Computational Complexity of Knot and Link Problems

Joel Hass·Jeffrey C. Lagarias·Nicholas Pippenger

View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the problem of deciding whether a polygonal knot in 3-dimensional Euclidean space is unknotted, capable of being continuously deformed without self-intersection so that it lies in a plane. We show that this problem, {\sc unknotting problem} is in {\bf NP}. We also consider the problem, {\sc unknotting problem} of determining whether two or more such polygons can be split, or continuously deformed without self-intersection so that they occupy both sides of a plane without intersecting it. We show that it also is in NP. Finally, we show that the problem of determining the genus of a polygonal knot (a generalization of the problem of determining whether it is unknotted) is in {\bf PSPACE}. We also give exponential worst-case running time bounds for deterministic algorithms to solve each of these problems. These algorithms are based on the use of normal surfaces and decision procedures due to W. Haken, with recent extensions by W. Jaco and J. L. Tollefson.

Explore related subjects

math.GT

Keep this discovery

BibTeX RIS

Joel Hass, Jeffrey C. Lagarias, Nicholas Pippenger. 1998-07-03. The Computational Complexity of Knot and Link Problems. https://arxiv.org/abs/math/9807016

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bar cohomology of links: beyond Milnor invariants

We develop bar cohomology of link complements as an invariant of links in homology spheres. In this setting, bar cohomology is a Hopf algebra which is calculable using surfaces and their intersection curves in a link complement. In this first in a sequence of works, we introduce the invariant and show that it defines a canonical subspace of the tensor Hopf algebra, which already encodes information about Milnor's link invariants and provides geometrically significant information beyond them.

math.GT↗

arXiv2026

A counterexample to the wrapping number conjecture

We exhibit an annular knot with wrapping number four whose Kauffman bracket has annular degree at most two. This disproves the wrapping number conjecture.

math.GT↗

arXiv2026

Homological lifts of Arnold invariants $J^-$ and $J^+$

Viro's Euler-integral polynomial $P_C(q)$ and the Lanzat--Polyak quantized-curvature polynomial $I_q(C)$ refine Arnold's invariants $J^-$ and $J^+$ for generic immersed one-component plane curves. We construct homological lifts of both. The bigraded region homology retains the singular homology of every connected Alexander-index region; its graded Euler characteristic is $P_C(q)$. The triply graded smoothing-circle homology is generated by the oriented circles of the orientation-preserving smoothing and decategorifies to the smoothing term in $I_q(C)$. Keeping the actual region summands and the boundary regions of every smoothing circle gives a homological refinement of the oriented smoothing configuration, or Seifert state. An infinite family proves strictness: both polynomial data and the ordinary homological lifts agree, while the component-graded region homology and the branch-decomposed circle homology distinguish every pair. Further constructions recover the full $I_q(C)$ by a vertex complex, realize the local change of its curvature integral by edge homology, and give a canonical two-state homology for unoriented curves. Viro described his Euler-integral formula as an analogue of face state-sum formulas for quantum knot polynomials. Through the categorifications developed here, we obtain one concrete homological face-state-sum model realizing that analogy.

math.GT↗