pith. sign in

arxiv: 1210.4490 · v1 · pith:SQOYQPKZnew · submitted 2012-10-16 · 🧮 math.GT

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

classification 🧮 math.GT
keywords complexitymanifoldsmatveevboundarycasecrystallizationgem-matveevintroduced
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.