Algorithmic homeomorphism of 3-manifolds as a corollary of geometrization

Abstract

In this paper we prove two results, one semi-historical and the other new. The semi-historical result, which goes back to Thurston and Riley, is that the geometrization theorem implies that there is an algorithm for the homeomorphism problem for closed, oriented, triangulated 3-manifolds. We give a self-contained proof, with several variations at each stage, that uses only the statement of the geometrization theorem, basic hyperbolic geometry, and old results from combinatorial topology and computer science. For this result, we do not rely on normal surface theory, methods from geometric group theory, nor methods used to prove geometrization. The new result is that the homeomorphism problem is elementary recursive, i.e., that the computational complexity is bounded by a bounded tower of exponentials. This result relies on normal surface theory, Mostow rigidity, and bounds on the computational complexity of solving algebraic equations.

24 pages. This version is a substantial revision and expansion in response to referee comments

References in corpus (2)

• Suspensions of homology spheres
• The homeomorphism problem for closed 3-manifolds

Cited by in corpus (11)

• Embeddability in ${\mathbb{R}}^3$ is NP-hard
• Recognition of Seifert fibered spaces with boundary is in NP
• Bounds on Pachner moves and systoles of cusped 3-manifolds
• Computational complexity and 3-manifolds and zombies
• Causal dynamics of discrete manifolds
• On the treewidth of triangulated 3-manifolds
• The Homeomorphism Problem For Hyperbolic Manifolds I
• A polynomial time algorithm to compute quantum invariants of 3-manifolds with bounded first Betti number
• Learning 3-Manifold Triangulations
• On the width of complicated JSJ decompositions
• Connecting 3-manifold triangulations with unimodal sequences of elementary moves