Three-Manifolds Having Complexity At Most 9
From MaRDI portal
Abstract: We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such manifold, by recognizing its canonical decomposition into Seifert fibred spaces and hyperbolic manifolds. The algorithm relies on the extension of Matveev's theory of complexity to the case of manifolds bounded by suitably marked tori, and on the notion of assembling of two such manifolds. We show that every manifold is an assembling of manifolds which cannot be further deassembled, and we prove that there are surprisingly few such manifolds up to complexity 9. Our most interesting experimental discovery is the following: there are 4 hyperbolic manifolds having complexity 9, and they turn out to be precisely the 4 closed hyperbolic manifolds of least known volume. All other manifolds having complexity at most 9 are graph manifolds.
Recommendations
- Degree Nine Manifolds of Dimension Greater than or Equal to 3
- Complexity of 3-manifolds
- Complexity of geometric three-manifolds
- scientific article; zbMATH DE number 1734671
- The extended complexity of three-manifolds
- scientific article; zbMATH DE number 2201375
- Complexity of 3-manifolds and combed 3-manifolds
- Complexity of three-dimensional manifolds: problems and results
- The structure of 3-manifolds of complexity zero
- Complexity theory of three-dimensional manifolds
Cites work
Cited in
(37)- Non-orientable 3-manifolds of small complexity
- Complexity of geometric three-manifolds
- Classifying genus two 3-manifolds up to 34 tetrahedra
- The long-eight-figure spines of lens spaces and binary trees
- Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
- \(\mathbb Z_2\)-Thurston norm and complexity of 3-manifolds
- On reduced complexity of closed piecewise linear 5-manifolds
- The complexity of orientable graph manifolds
- Building three-dimensional differentiable manifolds numerically
- Hyperbolic 3-manifolds with geodesic boundary: enumeration and volume calculation
- Computing Matveev's complexity via crystallization theory: the orientable case
- Four-manifolds with Shadow-complexity Zero
- scientific article; zbMATH DE number 4129649 (Why is no real title available?)
- STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
- A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA
- 3-manifolds efficiently bound 4-manifolds
- Hyperbolic graphs of small complexity
- NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA
- TWO-SIDED ASYMPTOTIC BOUNDS FOR THE COMPLEXITY OF SOME CLOSED HYPERBOLIC THREE-MANIFOLDS
- Moves for standard skeleta of 3-manifolds with marked boundary
- Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
- Spines and topology of thin Riemannian manifolds
- Inflations of ideal triangulations
- FACE PAIRING GRAPHS AND 3-MANIFOLD ENUMERATION
- Cusped hyperbolic 3-manifolds of complexity 10 having maximum volume
- scientific article; zbMATH DE number 7319011 (Why is no real title available?)
- The simplicial volume of 3-manifolds with boundary
- New aspects of complexity theory for 3-manifolds
- Dehn surgeries on the figure eight knot: an upper bound for complexity
- The triangulation complexity of fibred 3-manifolds
- The triangulation complexity of elliptic and sol 3-manifolds
- On a volume invariant of 3-manifolds
- A new approach to crushing 3-manifold triangulations
- Complexity theory of three-dimensional manifolds
- Estimating Matveev's complexity via crystallization theory
- A note about complexity of Lens spaces
- Complexity of PL manifolds
This page was built for publication: Three-Manifolds Having Complexity At Most 9
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736651)
