A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA

DOI10.1142/S0218216508006312MaRDI QIDQ3519944zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

colored graphcomplexitycrystallizationcolored triangulations

Mathematics Subject Classification ID

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)

Abstract: The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed by several authors with respect to orientable 3-manifolds up to 28 coloured tetrahedra, non-orientable 3-manifolds up to 26 coloured tetrahedra, genus two 3-manifolds up to 34 coloured tetrahedra: in fact, by automatic generation and analysis of suitable edge-coloured graphs, called crystallizations, we obtain a catalogue of all orientable 3-manifolds admitting coloured triangulations with 30 tetrahedra. These manifolds are unambiguously identified via JSJ decompositions and fibering structures. It is worth noting that, in the present work, a suitable use of elementary combinatorial moves yields an automatic partition of the elements of the generated crystallization catalogue into equivalence classes, which are proved to be in one-to one correspondence with the homeomorphism classes of the represented manifolds.

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

Cites work

• scientific article; zbMATH DE number 3422404 (Why is no real title available?)
• A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
• Classification of nonorientable 3-manifolds admitting decompositions into \(\leqq 26\) coloured tetrahedra
• Classifying genus two 3-manifolds up to 34 tetrahedra
• Complexity of geometric three-manifolds
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
• Computing Matveev's complexity via crystallization theory: the orientable case
• Crystallisation moves
• Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find
• FACE PAIRING GRAPHS AND 3-MANIFOLD ENUMERATION
• Non-orientable 3-manifolds of complexity up to 7
• Non-orientable 3-manifolds of small complexity
• STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
• Temperley-Lieb Recoupling Theory and Invariants of 3-Manifolds (AM-134)
• Three-Manifolds Having Complexity At Most 9
• n-graphs

Cited in

(24)

• Counting gluings of octahedra
• An algorithmic approach to construct crystallizations of 3-manifolds from presentations of fundamental groups
• Regular genus and gem-complexity of some mapping tori
• Computing Matveev's complexity via crystallization theory: the orientable case
• PL 4-manifolds admitting simple crystallizations: framed links and regular genus
• Lower bounds for regular genus and gem-complexity of PL 4-manifolds with boundary
• Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds
• 4-colored graphs and knot/link complements
• Crystallizations of compact 4-manifolds minimizing combinatorially defined PL-invariants
• THE FUNDAMENTAL GROUPS OF CLOSED ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH LESS THAN 30 TETRAHEDRA
• Cataloguing PL 4-manifolds by gem-complexity
• Lower bounds for regular genus and gem-complexity of PL 4-manifolds
• On graph-theoretical invariants of combinatorial manifolds
• Efficient enumeration of 3-manifold triangulations
• Minimal crystallizations of 3-manifolds
• On the number of coloured triangulations of \(d\)-manifolds
• A census of genus-two 3-manifolds up to 42 coloured tetrahedra
• NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA
• Minimal crystallizations of 3-manifolds with boundary
• Compact 3-manifolds via 4-colored graphs
• Estimating Matveev's complexity via crystallization theory
• On reduced complexity of closed piecewise linear 5-manifolds
• Classifying compact 4-manifolds via generalized regular genus and \(G\)-degree
• G-degree for singular manifolds

Describes a project that uses

Uses Software

• GAP

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)