English

Computing Matveev's complexity via crystallization theory: the boundary case

Geometric Topology 2014-02-04 v1

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 D2\mathbb D^2 and two exceptional fibers and, therefore, for all torus knot complements.

Keywords

Cite

@article{arxiv.1210.4490,
  title  = {Computing Matveev's complexity via crystallization theory: the boundary case},
  author = {Maria Rita Casali and Paola Cristofori},
  journal= {arXiv preprint arXiv:1210.4490},
  year   = {2014}
}

Comments

27 pages, 14 figures

R2 v1 2026-06-21T22:22:49.192Z