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 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.