Related papers: The efficient certification of knottedness and Thu…

We show that the problem of deciding whether a knot in a fixed closed orientable 3-dimensional manifold bounds a surface of genus at most $g$ is in co-NP. This answers a question of Agol, Hass, and Thurston in 2002. Previously, this was…

We investigate the computational complexity of some problems in three-dimensional topology and geometry. We show that the problem of determining a bound on the genus of a knot in a 3-manifold, is NP-complete. Using similar ideas, we show…

Every element in the first cohomology group of a 3--manifold is dual to embedded surfaces. The Thurston norm measures the minimal `complexity' of such surfaces. For instance the Thurston norm of a knot complement determines the genus of the…

We show that three natural decision problems about links and 3-manifolds are computationally hard, assuming some conjectures in complexity theory. The first problem is determining whether a link in the 3-sphere bounds a Seifert surface with…

We study when the Thurston norm is detected by twisted Alexander polynomials associated to representations of the 3-manifold group to SL(2, C). Specifically, we show that the hyperbolic torsion polynomial determines the genus for a large…

We prove that the problem of deciding whether a 2- or 3-dimensional simplicial complex embeds into $\mathbb{R}^3$ is NP-hard. Our construction also shows that deciding whether a 3-manifold with boundary tori admits an $\mathbb{S}^{3}$…

We show that the problem of showing that a cusped 3-manifold M is not hyperbolic is in NP, assuming $S^3$-RECOGNITION is in coNP. To this end, we show that IRREDUCIBLE TOROIDAL RECOGNITION lies in NP. Along the way we unconditionally…

Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…

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…

Given a tame knot K presented in the form of a knot diagram, we show that the problem of determining whether K is knotted is in the complexity class NP, assuming the generalized Riemann hypothesis (GRH). In other words, there exists a…

We show that, for any prime p, a knot K in the 3-sphere is determined by its p-fold cyclic unbranched covering. We also investigate when the m-fold cyclic unbranched covering of a knot coincides with the n-fold cyclic unbranched covering of…

For a compact, orientable, irreducible 3-manifold with toroidal boundary that is not the product of a torus and an interval or a cable space, each boundary torus has a finite set of slopes such that, if avoided, the Thurston norm of a Dehn…

We prove that the three-sphere recognition problem lies in the complexity class NP. Our work relies on Thompson's original proof that the problem is decidable [Math. Res. Let., 1994], Casson's version of her algorithm, and recent results of…

Two fundamental objects in knot theory are the minimal genus surface and the least area surface bounded by a knot in a 3-dimensional manifold. When the knot is embedded in a general 3-manifold, the problems of finding these surfaces were…

Given a triangulation of a closed, oriented, irreducible, atoroidal 3-manifold every oriented, incompressible surface may be isotoped into normal position relative to the triangulation. Such a normal oriented surface is then encoded by…

We prove that deciding if a diagram of the unknot can be untangled using at most $k$ Riedemeister moves (where $k$ is part of the input) is NP-hard. We also prove that several natural questions regarding links in the $3$-sphere are NP-hard,…

We show that a regular isomorphism of profinite completion of the fundamental groups of two 3-manifolds $N_1$ and $N_2$ induces an isometry of the Thurston norms and a bijection between the fibered classes. We study to what extent does the…

There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…

We show that the problem of deciding whether a closed three-manifold admits an elliptic structure lies in NP. Furthermore, determining the homeomorphism type of an elliptic manifold lies in the complexity class FNP. These are both…

We investigate the complexity of finding an embedded non-orientable surface of Euler genus $g$ in a triangulated $3$-manifold. This problem occurs both as a natural question in low-dimensional topology, and as a first non-trivial instance…