Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find
Benjamin A. Burton
Abstract
Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P2-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 P2-irreducible 3-manifolds that can be formed from at most ten tetrahedra.
Create a lesson
Related papers
Mapping class groups have a unique Polish group structure
Tyrone Ghaswala, Sumun Iyer, Robert Alonzo Lyman et al.
Around the Andreadakis-Johnson filtration
Yusuke Kuno
Mapping class groups of simply connected closed spin 5-manifolds with no 2- and 3-torsion in homology
Huize Jin
A note on surfaces with large systoles
Yifei Cai
Real ideal points, Conway spheres, and left-orderable Dehn fillings
Yi Wang
All once-extended 3D TQFTs are Reshetikhin--Turaev theories
Glen Lim