scientific article; zbMATH DE number 1734671
The author surveys recent results and conjectures concerning the notion of complexity \(c(M)\) of a 3-manifold. This notion was introduced earlier by the author and can be described roughly as the minimal number of vertices of a spine of the 3-manifold \(M\). The spine \(P\) of a compact 3-manifold \(M\) is a sub-polyhedron of \(M\), such that \(M\smallsetminus P\) is homeomorphic to an open ball or to \(\partial M\times(0,1]\). The same manifold can have different spines. An upper bound for the complexity can be easily obtained if one constructs some spine. The author gives examples of such constructions starting from a triangulation of the manifold or its Heegaard diagram. Also he describes a construction of a spine in the case of a knot complement. Complexity has some useful properties, for example, additivity with respect to the connected sum of manifolds: \(c(M_1\#M_2)=c(M_1)+c(M_2).\) The complexities of a 3-sphere, \(\mathbb{R} P^3\) and the lens space \(L_{3,1}\) are equal to 0. Tables enumerating manifolds with complexity less than 6 were obtained by the author and with complexity less than 9 (without the identification of manifolds) by \textit{B.~Martelli} and \textit{C.~Petronio}. Conjecture. The following formula holds true for the complexity of lens spaces \(L_{p,q}\): \(c(L_{p,q})=c(L_{p-q,q})+1.\) The problem of obtaining lower bounds for the complexity is difficult. One of such estimates is connected with the notion of complexity \(c(G)\) of a finitely presented group \(G=\langle a_1,\dots,a_n|r_1,\dots,r_m\rangle\). This is a minimum of \(|r_1|+\dots +|r_m|\) over all presentations of \(G\), where \(|r_i|\) is the length of the word \(r_i\). Theorem. Let \(M\) be a closed 3-manifold. Then we have \(c(M) \geq (1/3)c(\pi_1(M))-1.\) In the last sections of the paper the author defines and studies generalizations of the notion of complexity: the extended complexity and the reduced complexity. For the entire collection see [Zbl 0966.00048].
- Lower bounds for the complexity of three-dimensional manifolds.
- The long-eight-figure spines of lens spaces and binary trees
- Complexity of three-dimensional manifolds: problems and results
- The extended complexity of three-manifolds
- Cut loci in lens manifolds
- Manifolds of cubic complexity two
- A 3-manifold complexity via immersed surfaces
- Links and spines
- Construction of spines of two-bridge link complements and upper bounds of their Matveev complexities
- scientific article; zbMATH DE number 5008875 (Why is no real title available?)
- Complexity andT‐invariant of Abelian and Milnor groups, and complexity of 3‐manifolds
- Lower bounds for transversal complexity of torus bundles over the circle
- TWO-SIDED ASYMPTOTIC BOUNDS FOR THE COMPLEXITY OF SOME CLOSED HYPERBOLIC THREE-MANIFOLDS
- Complexity of links in 3-manifolds
- scientific article; zbMATH DE number 4103993 (Why is no real title available?)
- Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
- Complexities of 3-manifolds from triangulations, Heegard splittings, and surgery presentations
- On the complexity of three-dimensional cusped hyperbolic manifolds
- Three-Manifolds Having Complexity At Most 9
- scientific article; zbMATH DE number 7319011 (Why is no real title available?)
- Convexity of Morse stratifications and gradient spines of 3-manifolds
- New aspects of complexity theory for 3-manifolds
- Exact values of complexity for Paoluzzi-Zimmermann manifolds
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4328655)