NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA

DOI10.1142/S0218216509006975zbMath1177.57021arXiv0705.1487OpenAlexW2115399178MaRDI QIDQ3631180

Paola Cristofori, Paola Bandieri, Carlo Gagliardi

Publication date: 5 June 2009

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

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

zbMATH Keywords

complexitycolored graphcrystallizationprime manifoldcolored triangulation

Mathematics Subject Classification ID

Related Items (14)

Crystallizations of compact 4-manifolds minimizing combinatorially defined PL-invariants ⋮ Lower bounds for regular genus and gem-complexity of PL 4-manifolds ⋮ Compact 3-manifolds via 4-colored graphs ⋮ G-degree for singular manifolds ⋮ Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds ⋮ 4-colored graphs and knot/link complements ⋮ Cataloguing PL 4-manifolds by gem-complexity ⋮ Classifying compact 4-manifolds via generalized regular genus and \(G\)-degree ⋮ Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams ⋮ Topology in colored tensor models via crystallization theory ⋮ A census of genus-two 3-manifolds up to 42 coloured tetrahedra ⋮ PL 4-manifolds admitting simple crystallizations: framed links and regular genus ⋮ Regular genus and gem-complexity of some mapping tori ⋮ Minimal crystallizations of 3-manifolds with boundary

Cites Work

• Crystallisation moves
• 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
• Classifying genus two 3-manifolds up to 34 tetrahedra
• 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
• STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
• A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA
• Three-Manifolds Having Complexity At Most 9

This page was built for publication: NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA