Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams

DOI10.1016/j.topol.2012.05.016zbMath1250.57021arXiv1203.0183OpenAlexW2090133103MaRDI QIDQ439303

Michele Mulazzani, Maria Rita Casali, Paola Cristofori

Publication date: 16 August 2012

Published in: Topology and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

crystallizationsHeegaard diagramscomplexity of 3-manifolds

Mathematics Subject Classification ID

Related Items (3)

Compact 3-manifolds via 4-colored graphs ⋮ Cataloguing PL 4-manifolds by gem-complexity ⋮ COMPUTING MATVEEV'S COMPLEXITY VIA CRYSTALLIZATION THEORY: THE BOUNDARY CASE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coverings and minimal triangulations of 3-manifolds
• Complexity theory of three-dimensional manifolds
• Two-sided bounds for the complexity of cyclic branched coverings of two-bridge links
• Estimating Matveev's complexity via crystallization theory
• A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
• Classification of nonorientable 3-manifolds admitting decompositions into \(\leqq 26\) coloured tetrahedra
• Non-orientable 3-manifolds of small complexity
• Computer classification of 3-manifolds.
• Non-orientable 3-manifolds of complexity up to 7
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
• Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find
• Computing Matveev's complexity via crystallization theory: the orientable case
• COMPLEXITY, HEEGAARD DIAGRAMS AND GENERALIZED DUNWOODY MANIFOLDS
• Minimal triangulations for an infinite family of lens spaces
• NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA
• TWO-SIDED ASYMPTOTIC BOUNDS FOR THE COMPLEXITY OF SOME CLOSED HYPERBOLIC THREE-MANIFOLDS
• TRANSFORMATIONS OF SPECIAL SPINES AND THE ZEEMAN CONJECTURE
• Extending the Concept of Genus to Dimension N
• Three-Manifolds Having Complexity At Most 9
• Tabulation of three-dimensional manifolds
• Algorithmic topology and classification of 3-manifolds

This page was built for publication: Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams