Heegaard structure respects complicated JSJ decompositions (Q303600)

From MaRDI portal





scientific article; zbMATH DE number 6618527
Language Label Description Also known as
default for all languages
No label defined
    English
    Heegaard structure respects complicated JSJ decompositions
    scientific article; zbMATH DE number 6618527

      Statements

      Heegaard structure respects complicated JSJ decompositions (English)
      0 references
      0 references
      0 references
      0 references
      22 August 2016
      0 references
      Given a suitable \(3\)-manifold (connected or disconnected) that has two toral boundary components, a new manifold can be created by gluing the two tori together. The primary result of this paper is that, if the gluing map is `sufficiently complicated', any closed, orientable surface in the resulting manifold that is either incompressible or strongly irreducible can be isotoped into the original manifold. This extends previous results of \textit{D. Bachman} et al. [Algebr. Geom. Topol. 6, 171--194 (2006; Zbl 1099.57016)] about the case where the original manifold is disconnected. Related results have also been obtained by \textit{M. Lackenby} [Geom. Dedicata 109, 139--145 (2004; Zbl 1081.57018)] and \textit{T. Li} [Geom. Topol. Monogr. 12, 157--190 (2007; Zbl 1153.57016)]. The definition of complexity is then extended to gluing along multiple tori. This is applied to a set of `complicated' JSJ tori, viewed as part of a generalised Heegaard splitting. In this case, any Heegaard splitting for the whole manifold is an amalgamation of splittings for the pieces. The definition of complexity used in this paper is defined by triangulating the manifold and considering surfaces that `meet the \(2\)-skeleton of the triangulation normally'. A normal curve on the boundary of a tetrahedron is one consisting of arcs with endpoints on distinct edges. Such a curve is either a triangle (around one vertex) or has \(4n\) edges for some \(n\). The complexity of such a surface is defined using the maximum length of the normal curves. A normal surface will have complexity \(0\). The \(c\)-complexity of a gluing is found using the distance in the Farey graph of slopes of typed compatibility classes of surfaces with complexity at most \(c\).
      0 references
      Heegaard splitting
      0 references
      JSJ decomposition
      0 references
      normal curves
      0 references
      amalgamation
      0 references
      0 references

      Identifiers