Computational aspects of crystallization theory: complexity, catalogues and classifications of 3-manifolds

MaRDI QIDQ4648919zbMATH OpenFDO

Authors Paola Bandieri, Maria Rita Casali, Paola Cristofori, Luigi Grasselli, Michele Mulazzani

Publication date 16 November 2012

zbMATH Keywords

complexity3-manifoldalgorithmic generation and classificationcrystallization theorygeneralized Heegaard diagram

Mathematics Subject Classification ID

Relations of low-dimensional topology with graph theory (57M15)

Recommendations

• Computing Matveev's complexity via crystallization theory: the orientable case
• scientific article; zbMATH DE number 6608126
• The combinatorics of piecewise linear manifolds by colored graphs
• scientific article; zbMATH DE number 1133267
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory

Cited in

(11)

• scientific article; zbMATH DE number 1339876 (Why is no real title available?)
• scientific article; zbMATH DE number 3958250 (Why is no real title available?)
• PL 4-manifolds admitting simple crystallizations: framed links and regular genus
• Cataloguing PL 4-manifolds by gem-complexity
• Random tensors and quantum gravity
• scientific article; zbMATH DE number 820881 (Why is no real title available?)
• Compact 3-manifolds via 4-colored graphs
• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• The combinatorics of piecewise linear manifolds by colored graphs
• An algorithmic approach to construct crystallizations of 3-manifolds from presentations of fundamental groups
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory

This page was built for publication: Computational aspects of crystallization theory: complexity, catalogues and classifications of 3-manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4648919)