The complexity of the normal surface solution space

Abstract

Normal surface theory is a central tool in algorithmic three-dimensional topology, and the enumeration of vertex normal surfaces is the computational bottleneck in many important algorithms. However, it is not well understood how the number of such surfaces grows in relation to the size of the underlying triangulation. Here we address this problem in both theory and practice. In theory, we tighten the exponential upper bound substantially; furthermore, we construct pathological triangulations that prove an exponential bound to be unavoidable. In practice, we undertake a comprehensive analysis of millions of triangulations and find that in general the number of vertex normal surfaces is remarkably small, with strong evidence that our pathological triangulations may in fact be the worst case scenarios. This analysis is the first of its kind, and the striking behaviour that we observe has important implications for the feasibility of topological algorithms in three dimensions.

Extended abstract (i.e., conference-style), 14 pages, 8 figures, 2 tables; v2: added minor clarifications

References in corpus (2)

• An algorithm to determine the Heegaard genus of a 3-manifold
• The Weber-Seifert dodecahedral space is non-Haken

Cited by in corpus (8)

• The Pachner graph and the simplification of 3-sphere triangulations
• Simplification paths in the Pachner graphs of closed orientable 3-manifold triangulations
• Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations
• Maximal admissible faces and asymptotic bounds for the normal surface solution space
• The Weber-Seifert dodecahedral space is non-Haken
• A tree traversal algorithm for decision problems in knot theory and 3-manifold topology
• Enumerating fundamental normal surfaces: Algorithms, experiments and invariants
• The Least Spanning Area of a Knot and the Optimal Bounding Chain Problem