A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA
From MaRDI portal
Publication:3519944
DOI10.1142/S0218216508006312zbMath1163.57017arXivmath/0606359OpenAlexW2062928624MaRDI QIDQ3519944
Maria Rita Casali, Paola Cristofori
Publication date: 19 August 2008
Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0606359
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (20)
Crystallizations of compact 4-manifolds minimizing combinatorially defined PL-invariants ⋮ Lower bounds for regular genus and gem-complexity of PL 4-manifolds ⋮ Lower bounds for regular genus and gem-complexity of PL 4-manifolds with boundary ⋮ Compact 3-manifolds via 4-colored graphs ⋮ An algorithmic approach to construct crystallizations of 3-manifolds from presentations of fundamental groups ⋮ Estimating Matveev's complexity via crystallization theory ⋮ G-degree for singular manifolds ⋮ Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds ⋮ 4-colored graphs and knot/link complements ⋮ Minimal crystallizations of 3-manifolds ⋮ Cataloguing PL 4-manifolds by gem-complexity ⋮ Classifying compact 4-manifolds via generalized regular genus and \(G\)-degree ⋮ On graph-theoretical invariants of combinatorial manifolds ⋮ A census of genus-two 3-manifolds up to 42 coloured tetrahedra ⋮ PL 4-manifolds admitting simple crystallizations: framed links and regular genus ⋮ Computing Matveev's complexity via crystallization theory: the orientable case ⋮ NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA ⋮ On reduced complexity of closed piecewise linear 5-manifolds ⋮ Regular genus and gem-complexity of some mapping tori ⋮ Minimal crystallizations of 3-manifolds with boundary
Uses Software
Cites Work
- Unnamed Item
- Crystallisation moves
- A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
- n-graphs
- Classification of nonorientable 3-manifolds admitting decompositions into \(\leqq 26\) coloured tetrahedra
- Non-orientable 3-manifolds of small complexity
- Complexity of geometric three-manifolds
- 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
- Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds (AM-134)
- FACE PAIRING GRAPHS AND 3-MANIFOLD ENUMERATION
- Three-Manifolds Having Complexity At Most 9
This page was built for publication: A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA