No label defined (Q4328655)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1734671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1734671 |
Statements
28 April 2002
0 references
complexity
0 references
spine
0 references
3-manifold
0 references
0.8933771848678589
0 references
0.8520030379295349
0 references
0.8491994142532349
0 references
0.8488091826438904
0 references
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].
0 references