Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find

DOI10.1007/s00454-007-1307-xzbMath1133.57001arXivmath/0604584OpenAlexW2096952305MaRDI QIDQ2465412

Benjamin A. Burton

Publication date: 4 January 2008

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0604584

zbMATH Keywords

3-manifoldminimal triangulationcensus

Mathematics Subject Classification ID

Triangulating manifolds (57Q15) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04)

Related Items

Estimating Matveev's complexity via crystallization theory ⋮ Cataloguing PL 4-manifolds by gem-complexity ⋮ On the complexity of non-orientable Seifert fibre spaces ⋮ A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA ⋮ Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams ⋮ New aspects of complexity theory for 3-manifolds ⋮ Combinatorial 3-manifolds with transitive cyclic symmetry ⋮ Optimizing the double description method for normal surface enumeration ⋮ Complexity of PL manifolds ⋮ NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA

Uses Software

• Regina

This page was built for publication: Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find