A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA
DOI10.1142/S0218216508006312zbMATH Open1163.57017arXivmath/0606359OpenAlexW2062928624MaRDI QIDQ3519944FDOQ3519944
Authors: 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
Recommendations
- NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA
- THE FUNDAMENTAL GROUPS OF CLOSED ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH LESS THAN 30 TETRAHEDRA
- Classifying genus two 3-manifolds up to 34 tetrahedra
- Computing Matveev's complexity via crystallization theory: the orientable case
- Observations from the 8-Tetrahedron Nonorientable Census
Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Relations of low-dimensional topology with graph theory (57M15) Triangulating manifolds (57Q15)
Cites Work
- Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds (AM-134)
- Title not available (Why is that?)
- A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
- Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
- Computing Matveev's complexity via crystallization theory: the orientable case
- Classification of nonorientable 3-manifolds admitting decompositions into \(\leqq 26\) coloured tetrahedra
- STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
- Crystallisation moves
- n-graphs
- Complexity of geometric three-manifolds
- Three-Manifolds Having Complexity At Most 9
- Non-orientable 3-manifolds of small complexity
- Non-orientable 3-manifolds of complexity up to 7
- Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find
- FACE PAIRING GRAPHS AND 3-MANIFOLD ENUMERATION
- Classifying genus two 3-manifolds up to 34 tetrahedra
Cited In (24)
- Regular genus and gem-complexity of some mapping tori
- Computing Matveev's complexity via crystallization theory: the orientable case
- Crystallizations of compact 4-manifolds minimizing combinatorially defined PL-invariants
- Efficient enumeration of 3-manifold triangulations
- THE FUNDAMENTAL GROUPS OF CLOSED ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH LESS THAN 30 TETRAHEDRA
- G-degree for singular manifolds
- Counting gluings of octahedra
- NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA
- On graph-theoretical invariants of combinatorial manifolds
- Lower bounds for regular genus and gem-complexity of PL 4-manifolds
- PL 4-manifolds admitting simple crystallizations: framed links and regular genus
- Estimating Matveev's complexity via crystallization theory
- Cataloguing PL 4-manifolds by gem-complexity
- Minimal crystallizations of 3-manifolds with boundary
- Compact 3-manifolds via 4-colored graphs
- On the number of coloured triangulations of \(d\)-manifolds
- An algorithmic approach to construct crystallizations of 3-manifolds from presentations of fundamental groups
- Minimal crystallizations of 3-manifolds
- A census of genus-two 3-manifolds up to 42 coloured tetrahedra
- Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds
- Classifying compact 4-manifolds via generalized regular genus and \(G\)-degree
- On reduced complexity of closed piecewise linear 5-manifolds
- Lower bounds for regular genus and gem-complexity of PL 4-manifolds with boundary
- 4-colored graphs and knot/link complements
Uses Software
This page was built for publication: A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519944)