33
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      A new approach to crushing 3-manifold triangulations

      Preprint
       

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The crushing operation of Jaco and Rubinstein is a powerful technique in algorithmic 3-manifold topology: it enabled the first practical implementations of 3-sphere recognition and prime decomposition of orientable manifolds, and it plays a prominent role in state-of-the-art algorithms for unknot recognition and testing for essential surfaces. Although the crushing operation will always reduce the size of a triangulation, it might alter its topology, and so it requires a careful theoretical analysis for the settings in which it is used. The aim of this short paper is to make the crushing operation more accessible to practitioners, and easier to generalise to new settings. When the crushing operation was first introduced, the analysis was powerful but extremely complex. Here we give a new treatment that reduces the crushing process to a sequential combination of three "atomic" operations on a cell decomposition, all of which are simple to analyse. As an application, we generalise the crushing operation to the setting of non-orientable 3-manifolds, where we obtain a new practical and robust algorithm for non-orientable prime decomposition. We also apply our crushing techniques to the study of non-orientable minimal triangulations.

          Related collections

          Most cited references7

          • Record: found
          • Abstract: not found
          • Book Chapter: not found

          Computing Simplicial Homology Based on Efficient Smith Normal Form Algorithms

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Decision problems in the space of Dehn fillings

              Bookmark
              • Record: found
              • Abstract: found
              • Article: found
              Is Open Access

              Face pairing graphs and 3-manifold enumeration

              The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed minimal P^2-irreducible triangulation. In addition we present constraints upon the combinatorial structure of such a triangulation that can be deduced from its face pairing graph. These results are then applied to the enumeration of closed minimal P^2-irreducible 3-manifold triangulations, leading to a significant improvement in the performance of the enumeration algorithm. Results are offered for both orientable and non-orientable triangulations.
                Bookmark

                Author and article information

                Journal
                06 December 2012
                2014-01-06
                Article
                10.1007/s00454-014-9572-y
                1212.1441
                f71378fa-05d0-4987-a7dd-b8106cf0f898

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                History
                Custom metadata
                Primary 57N10, Secondary 57Q15, 68W05
                Discrete and Computational Geometry 52 (2014), no. 1, 116-139
                23 pages, 14 figures; v2: many revisions, plus a new section on minimal triangulations; v3: minor revisions. This is the full journal version of a paper from SCG 2013, and will appear in Discrete & Computational Geometry
                math.GT cs.CG

                Comments

                Comment on this article