arXiv · math/0604584
Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find
Abstract
Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most ten tetrahedra.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Benjamin A. Burton. 2006-04-27. Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find. https://doi.org/10.1007/s00454-007-1307-x
Cite the original work for its findings. Save a collection to share your selection of sources.