eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2024-06-06
30:1
30:16
10.4230/LIPIcs.SoCG.2024.30
article
Effective Computation of the Heegaard Genus of 3-Manifolds
Burton, Benjamin A.
1
https://orcid.org/0000-0002-3478-3301
Thompson, Finn
1
https://orcid.org/0000-0003-3241-8332
The University of Queensland, Brisbane, Australia
The Heegaard genus is a fundamental invariant of 3-manifolds. However, computing the Heegaard genus of a triangulated 3-manifold is NP-hard, and while algorithms exist, little work has been done in making such an algorithm efficient and practical for implementation. Current algorithms use almost normal surfaces, which are an extension of the algorithm-friendly normal surface theory but which add considerable complexity for both running time and implementation.
Here we take a different approach: instead of working with almost normal surfaces, we give a general method of modifying the input triangulation that allows us to avoid almost normal surfaces entirely. The cost is just four new tetrahedra, and the benefit is that important surfaces that were once almost normal can be moved to the simpler setting of normal surfaces in the new triangulation. We apply this technique to the computation of Heegaard genus, where we develop algorithms and heuristics that prove successful in practice when applied to a data set of 3,000 closed hyperbolic 3-manifolds; we precisely determine the genus for at least 2,705 of these.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol293-socg2024/LIPIcs.SoCG.2024.30/LIPIcs.SoCG.2024.30.pdf
3-manifolds
triangulations
normal surfaces
computational topology
Heegaard genus