Complexity of geometric three-manifolds
From MaRDI portal
Abstract: We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show that the upper bounds on Matveev's complexity implied by our computations are sharp for thousands of manifolds, and we conjecture they are for infinitely many, including all Seifert manifolds. Our computations and estimates apply to all the Dehn fillings of M6_1^3 (the complement of the three-component chain-link, conjectured to be the smallest triply cusped hyperbolic manifold), whence to infinitely many among the smallest closed hyperbolic manifolds. Our computations are based on the machinery of the decomposition into `bricks' of irreducible manifolds, developed in a previous paper. As an application of our results we completely describe the geometry of all 3-manifolds of complexity up to 9.
Recommendations
Cites work
- scientific article; zbMATH DE number 1095722 (Why is no real title available?)
- scientific article; zbMATH DE number 1467250 (Why is no real title available?)
- A census of cusped hyperbolic 3-manifolds
- A new decomposition theorem for 3-manifolds
- Algebraic linearity for an automorphism of a surface group
- Algorithmic topology and classification of 3-manifolds
- Complexity theory of three-dimensional manifolds
- Lower bounds for transversal complexity of torus bundles over the circle
- Symmetries, Isometries and Length Spectra of Closed Hyperbolic Three-Manifolds
- The Geometries of 3-Manifolds
- Three-Manifolds Having Complexity At Most 9
- Transformation Groups and Natural Bundles
Cited in
(33)- \(\mathbb{Z}_2\)-Thurston norm and complexity of 3-manifolds. II
- TWO-SIDED ASYMPTOTIC BOUNDS FOR THE COMPLEXITY OF SOME CLOSED HYPERBOLIC THREE-MANIFOLDS
- Hyperbolic graphs of small complexity
- Computing Matveev's complexity via crystallization theory: the boundary case
- Complexity of triangulations of the projective space.
- Lower bounds for the complexity of three-dimensional manifolds.
- On the complexity of non-orientable Seifert fibre spaces
- Three-Manifolds Having Complexity At Most 9
- A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA
- Two-sided bounds for the complexity of hyperbolic three-manifolds with geodesic boundary
- On the complexity of the Heegaard structure of hyperbolic 3-manifolds
- scientific article; zbMATH DE number 4129649 (Why is no real title available?)
- Moves for standard skeleta of 3-manifolds with marked boundary
- The triangulation complexity of fibred 3-manifolds
- Manifolds of cubic complexity two
- New aspects of complexity theory for 3-manifolds
- STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
- Two-sided bounds for the complexity of cyclic branched coverings of two-bridge links
- scientific article; zbMATH DE number 4103993 (Why is no real title available?)
- On the complexity of three-dimensional cusped hyperbolic manifolds
- Links and spines
- Dehn surgeries on the figure eight knot: an upper bound for complexity
- Complexities of 3-manifolds from triangulations, Heegard splittings, and surgery presentations
- Complexity andT‐invariant of Abelian and Milnor groups, and complexity of 3‐manifolds
- Non-orientable 3-manifolds of complexity up to 7
- scientific article; zbMATH DE number 7319011 (Why is no real title available?)
- Complexity of 3-orbifolds
- On the existence of branched coverings between surfaces with prescribed branch data. I
- A complexity of compact \(3\)-manifolds via immersed surfaces
- The complexity of orientable graph manifolds
- On complexity of three-dimensional hyperbolic manifolds with geodesic boundary
- On the complexity and volume of hyperbolic 3-manifolds
- Upper bounds for the complexity of torus knot complements
This page was built for publication: Complexity of geometric three-manifolds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768249)
