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

DOI10.1142/S0218216513500387MaRDI QIDQ2848021zbMATH OpenFDO

Authors Maria Rita Casali, Paola Cristofori

Publication date 25 September 2013

Published in Journal of Knot Theory and its Ramifications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1210.4490

zbMATH Keywords

3-manifolds with boundarycrystallizationMatveev's complexitySeifert manifold

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15)

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.

Review text

\textit{S. V. Matveev}'s complexity is a well-known invariant for 3-manifolds defined in [Acta Appl. Math. 19, No. 2, 101--130 (1990; Zbl 0724.57012)]. The Gem-Matveev complexity (GM-complexity) has been introduced within crystallization theory, \textit{M. R. Casali} [Topology Appl. 144, No. 1--3, 201--209 (2004; Zbl 1059.57010)]. The modified Heegaard complexity (HM-complexity) has been introduced by \textit{A. Cattabriga} et al. [J. Korean Math. Soc. 47, No. 3, 585--599 (2010; Zbl 1198.57014)]. Both GM-complexity and HM-complexity are useful as upper bounds of Matveev complexity. The main result of the paper says that for every compact irreducible and boundary-irreducible 3-manifold the GM-complexity and HM-complexity coincide.

Recommendations

• Computing Matveev's complexity via crystallization theory: the orientable case
• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• Minimal crystallizations of 3-manifolds with boundary
• Complexity of geometric three-manifolds
• Estimating Matveev's complexity via crystallization theory

Cites work

• A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
• Classifying Pl 5-Manifolds by Regular Genus: The Boundary Case
• Cobordant crystallizations
• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• Complexity, Heegaard diagrams and generalized Dunwoody manifolds
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
• Computing Matveev's complexity via crystallization theory: the orientable case
• Estimating Matveev's complexity via crystallization theory
• On Heegaard decompositions of torus knot exteriors and related Seifert fibre spaces
• Representing 3-manifolds by a universal branching set

Cited in

(7)

• Minimal crystallizations of 3-manifolds with boundary
• Computing Matveev's complexity via crystallization theory: the orientable case
• Upper bounds for the complexity of torus knot complements
• Compact 3-manifolds via 4-colored graphs
• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• Estimating Matveev's complexity via crystallization theory
• A note about complexity of Lens spaces

This page was built for publication: Computing Matveev's complexity via crystallization theory: the boundary case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848021)