arXiv · 1210.4490
Computing Matveev's complexity via crystallization theory: the boundary case
Abstract
The notion of Gem-Matveev complexity has been introduced within crystallization theory, as a combinatorial method to estimate Matveev's complexity of closed 3-manifolds; it yielded upper bounds for interesting classes of such manifolds. In this paper we extend the definition to the case of non-empty boundary and prove that for each compact irreducible and boundary-irreducible 3-manifold it coincides with the modified Heegaard complexity introduced by Cattabriga, Mulazzani and Vesnin. Moreover, via Gem-Matveev complexity, we obtain an estimation of Matveev's complexity for all Seifert 3-manifolds with base $\mathbb D^2$ and two exceptional fibers and, therefore, for all torus knot complements.
Explore related subjects
Keep this discovery
Maria Rita Casali, Paola Cristofori. 2012-10-16. Computing Matveev's complexity via crystallization theory: the boundary case. https://doi.org/10.1142/s0218216513500387
Cite the original work for its findings. Save a collection to share your selection of sources.