Classifying genus two 3-manifolds up to 34 tetrahedra
type: Item
instance of: scholarly article
title: Classifying genus two 3-manifolds up to 34 tetrahedra
zbMATH Open document ID: 1071.57018
author: Paola Bandieri
author: C. Gagliardi
author: Laura Ricci
published in: Acta Applicandae Mathematicae
publication date: 2005-05-12T00:00:00Z
review text: The authors present a catalogue of all genus two 3-manifolds admitting a contracted triangulation with at most 32 simplexes. The main theorem of the article states: There are exactly 26 closed, connected orientable, prime 3-manifolds of genus two admitting a crystallization with at most 34 vertices. A \textit{crystallization} of a 3-manifold is a contracted \((n+1)\)-colored graph representing the 3-mainfold, where a vertex of the graph corresponds to a simplex. In the article the authors give a complete classification of the above 26 manifolds.
reviewed by: Claus Ernst
Mathematics Subject Classification ID: 57N10
Mathematics Subject Classification ID: 57M05
Mathematics Subject Classification ID: 57M15
zbMATH DE Number: 2167760
zbMATH Keywords: 3-manifold
zbMATH Keywords: Heegaard genus
zbMATH Keywords: crystallization
zbMATH Keywords: complexity
MaRDI profile type: Publication
full work available at URL: s10440-004-7027-9
OpenAlex ID: W2074260437
cites work: Q5290132
cites work: Q3828738
cites work: Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
cites work: 2-symmetric crystallizations and 2-fold branched coverings of \(S^ 3\)
cites work: Q3147476
cites work: Crystallisations of 2-Fold Branched Coverings of S 3
cites work: A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
cites work: Regular imbeddings of edge-coloured graphs
cites work: Extending the Concept of Genus to Dimension N
cites work: Q5614468
cites work: 2-symmetric transformations for 3-manifolds of genus 2
cites work: Q3916586
cites work: Q3266916
cites work: Q4857345
cites work: THE FUNDAMENTAL GROUPS OF CLOSED ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH LESS THAN 30 TETRAHEDRA
cites work: Complexity theory of three-dimensional manifolds
cites work: Algorithmic topology and classification of 3-manifolds
cites work: Three-Manifolds Having Complexity At Most 9
cites work: Classical tessellations and three-manifolds
cites work: Q4074117
cites work: Q4092670
cites work: Q5667781
cites work: Q3923266
cites work: 3-dimensional Euclidean manifolds represented by locally regular coloured graphs
DOI: 10.1007/S10440-004-7027-9
description: scientific article; zbMATH DE number 2167760