2011/10/27 by Benjamin A. Burton, Burton, Benjamin A.
Computer Science · Mathematics · #Advanced Combinatorial Mathematics #Computational Geometry (cs.CG) #D.1.3 #Digital Image Processing Techniques #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #G.2.1 #G.2.2 #Geometric Topology (math.GT) #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1110.6080
openalex publication_date 2011/10/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is important to have effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex before we can make it smaller than its original size. Here we present experimental work that suggests the reality is far different: for an exhaustive census of 81,800,394 one-vertex triangulations that span 1,901 distinct closed orientable 3-manifolds, we never need to add more than two extra tetrahedra, we never need more than a handful of Pachner moves (or bistellar flips), and the average number of Pachner moves decreases as the number of tetrahedra grows. If they generalise, these extremely surprising results would have significant implications for decision algorithms and the study of triangulations in 3-manifold topology. Key techniques include polynomial-time computable signatures that identify triangulations up to isomorphism, the isomorph-free generation of non-minimal triangulations, theoretical operations to reduce sequences of Pachner moves, and parallel algorithms for studying finite level sets in the infinite Pachner graph.