arXiv · 1203.0183
Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
Abstract
The idea of computing Matveev complexity by using Heegaard decompositions has been recently developed by two different approaches: the first one for closed 3-manifolds via crystallization theory, yielding the notion of Gem-Matveev complexity; the other one for compact orientable 3-manifolds via generalized Heegaard diagrams, yielding the notion of modified Heegaard complexity. In this paper we extend to the non-orientable case the definition of modified Heegaard complexity and prove that for closed 3-manifolds Gem-Matveev complexity and modified Heegaard complexity coincide. Hence, they turn out to be useful different tools to compute the same upper bound for Matveev complexity.
Explore related subjects
Keep this discovery
Maria Rita Casali, Paola Cristofori, Michele Mulazzani. 2012-03-01. Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams. https://doi.org/10.1016/j.topol.2012.05.016
Cite the original work for its findings. Save a collection to share your selection of sources.