A note about complexity of Lens spaces

DOI10.1515/FORUM-2013-0185zbMATH Open1339.57018arXiv1309.5728OpenAlexW2012825852MaRDI QIDQ889582FDOQ889582

Authors: Maria Rita Casali, Paola Cristofori 

Publication date: 9 November 2015

Published in: Forum Mathematicum (Search for Journal in Brave)

Abstract: Within crystallization theory, (Matveev's) complexity of a 3-manifold can be estimated by means of the combinatorial notion of GM-complexity. In this paper, we prove that the GM-complexity of any lens space L(p,q), with p greater than 2, is bounded by S(p,q)-3, where S(p,q) denotes the sum of all partial quotients in the expansion of q/p as a regular continued fraction. The above upper bound had been already established with regard to complexity; its sharpness was conjectured by Matveev himself and has been recently proved for some infinite families of lens spaces by Jaco, Rubinstein and Tillmann. As a consequence, infinite classes of 3-manifolds turn out to exist, where complexity and GM-complexity coincide. Moreover, we present and briefly analyze results arising from crystallization catalogues up to order 32, which prompt us to conjecture, for any lens space L(p,q) with p greater than 2, the following relation: k(L(p,q)) = 5 + 2 c(L(p,q)), where c(M) denotes the complexity of a 3-manifold M and k(M)+1 is half the minimum order of a crystallization of M.

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

Recommendations

• scientific article; zbMATH DE number 1734671
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
• Lower bounds for transversal complexity of torus bundles over the circle
• Computing Matveev's complexity via crystallization theory: the orientable case
• Estimating Matveev's complexity via crystallization theory
• New aspects of complexity theory for 3-manifolds
• Computing Matveev's complexity via crystallization theory: the boundary case
• Three-Manifolds Having Complexity At Most 9
• GEOMETRICAL SPINES OF LENS MANIFOLDS
• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams

zbMATH Keywords

lens spacescomplexity of \(3\)-manifolds

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15) Triangulating manifolds (57Q15)

Cited In (17)

• A new family of triangulations of \(\mathbb{R} P^d\)
• The long-eight-figure spines of lens spaces and binary trees
• Topology in colored tensor models via crystallization theory
• Minimal triangulations for an infinite family of lens spaces
• Coverings and minimal triangulations of 3-manifolds
• PL 4-manifolds admitting simple crystallizations: framed links and regular genus
• Cataloguing PL 4-manifolds by gem-complexity
• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• Kirby diagrams and 5-colored graphs representing compact 4-manifolds
• An algorithmic approach to construct crystallizations of 3-manifolds from presentations of fundamental groups
• Minimal crystallizations of 3-manifolds
• Title not available (Why is that?)
• Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds
• Title not available (Why is that?)
• Cut loci in lens manifolds
• Lens space determinants
• 4-colored graphs and knot/link complements

This page was built for publication: A note about complexity of Lens spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q889582)