Document

# An Edge-Based Framework for Enumerating 3-Manifold Triangulations

## File

LIPIcs.SOCG.2015.270.pdf
• Filesize: 482 kB
• 15 pages

## Cite As

Benjamin A. Burton and William Pettersson. An Edge-Based Framework for Enumerating 3-Manifold Triangulations. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 270-284, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.SOCG.2015.270

## Abstract

A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Although censuses are useful resources for mathematicians, constructing them is difficult: the best algorithms to date have not gone beyond n=12. The underlying algorithms essentially (i) enumerate all relevant 4-regular multigraphs on n nodes, and then (ii) for each multigraph G they enumerate possible 3-manifold triangulations with G as their dual 1-skeleton, of which there could be exponentially many. In practice, a small number of multigraphs often dominate the running times of census algorithms: for example, in a typical census on 10 tetrahedra, almost half of the running time is spent on just 0.3% of the graphs. Here we present a new algorithm for stage (ii), which is the computational bottleneck in this process. The key idea is to build triangulations by recursively constructing neighbourhoods of edges, in contrast to traditional algorithms which recursively glue together pairs of tetrahedron faces. We implement this algorithm, and find experimentally that whilst the overall performance is mixed, the new algorithm runs significantly faster on those "pathological" multigraphs for which existing methods are extremely slow. In this way the old and new algorithms complement one another, and together can yield significant performance improvements over either method alone.
##### Keywords
• triangulations
• enumeration
• graph theory

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Benjamin A. Burton. Face pairing graphs and 3-manifold enumeration. J. Knot Theory Ramifications, 13(8):1057-1101, 2004.
2. Benjamin A. Burton. Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find. Discrete & Computational Geometry, 38(3):527-571, 2007.
3. Benjamin A. Burton. Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations. In ISSAC 2011: Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, pages 59-66. ACM, 2011.
4. Benjamin A. Burton. The cusped hyperbolic census is complete. arXiv:1405.2695, 2014.
5. Benjamin A. Burton, Ryan Budney, and William Pettersson. Regina: Software for 3-manifold topology and normal surface theory. Licensed under GPLv2, 1999-2013.
6. Patrick J. Callahan, Martin V. Hildebrand, and Jeffrey R. Weeks. A census of cusped hyperbolic 3-manifolds. Math. Comp., 68(225):321-332, 1999. With microfiche supplement.
7. Martin Hildebrand and Jeffrey Weeks. A computer generated census of cusped hyperbolic 3-manifolds. In Computers and mathematics, pages 53-59. Springer, New York, 1989.
8. William Jaco and J. Hyam Rubinstein. 0-efficient triangulations of 3-manifolds. J. Differential Geom., 65(1):61-168, 2003.
9. Bruno. Martelli and Carlo. Petronio. Three-manifolds having complexity at most 9. Experimental Mathematics, 10(2):207-236, 2001.
10. Bruno Martelli and Carlo Petronio. A new decomposition theorem for 3-manifolds. Illinois J. Math., 46:755-780, 2002.
11. Sergei V. Matveev. Computer recognition of three-manifolds. Experiment. Math., 7(2):153-161, 1998.
12. Sergei V. Matveev. Algorithmic topology and classification of 3-manifolds, volume 9 of Algorithms and Computation in Mathematics. Springer, Berlin, second edition, 2007.
13. Sergei V. Matveev et al. Manifold recognizer, 2014. URL: http://www.matlas.math.csu.ru/?page=recognizer.
14. Edwin E. Moise. Affine structures in 3-manifolds. V. The triangulation theorem and Hauptvermutung. Ann. of Math. (2), 56:96-114, 1952.