Estimating Matveev's complexity via crystallization theory

DOI10.1016/J.DISC.2006.07.021zbMATH Open1131.57023OpenAlexW2039802324MaRDI QIDQ868331FDOQ868331

Maria Rita Casali

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.021

Recommendations

• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
• Computing Matveev's complexity via crystallization theory: the boundary case
• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• scientific article; zbMATH DE number 1734671
• New aspects of complexity theory for 3-manifolds

zbMATH Keywords

branched coveringscrystallizationMatveev's complexitySimple spine

Mathematics Subject Classification ID

Low-dimensional topology of special (e.g., branched) coverings (57M12) Relations of low-dimensional topology with graph theory (57M15)

Cites Work

• Modifications and Cobounding Manifolds
• A representation of orientable combinatorial 3-manifolds
• Title not available (Why is that?)
• A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
• Regular imbeddings of edge-coloured graphs
• Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory
• Computing Matveev's complexity via crystallization theory: the orientable case
• A CATALOGUE OF ORIENTABLE 3-MANIFOLDS TRIANGULATED BY 30 COLORED TETRAHEDRA
• Title not available (Why is that?)
• Complexity theory of three-dimensional manifolds
• Classification of nonorientable 3-manifolds admitting decompositions into \(\leqq 26\) coloured tetrahedra
• STRUCTURES OF SMALL CLOSED NON-ORIENTABLE 3-MANIFOLD TRIANGULATIONS
• Three-Manifolds Having Complexity At Most 9
• Non-orientable 3-manifolds of small complexity
• Computer classification of 3-manifolds.
• Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find
• Extending the Concept of Genus to Dimension N
• Representing manifolds by crystallization theory: foundations, improvements and related results
• THREE-MANIFOLDS AS 3-FOLD BRANCHED COVERS OF S³
• Title not available (Why is that?)
• The complexity of 2-fold branched coverings of a 3-sphere
• Every closed orientable 3-manifold is a 3-fold branched covering space of $S^3$
• Crystallisations of 2-Fold Branched Coverings of S 3
• Construction and properties of the \(t\)-invariant
• Coloured knots and coloured graphs representing 3-fold simple coverings of \(\mathbb{S}^ 3\)
• Representing branched coverings by edge-coloured graphs
• An algorithm producing a standard spine of a 3-manifold presented by surgery along a link
• FROM FRAMED LINKS TO CRYSTALLIZATIONS OF BOUNDED 4-MANIFOLDS

Cited In (7)

• Computing Matveev's complexity via crystallization theory: the orientable case
• The long-eight-figure spines of lens spaces and binary trees
• Computing Matveev's complexity via crystallization theory: the boundary case
• A mathematical basis for egress complexity
• New aspects of complexity theory for 3-manifolds
• Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
• A note about complexity of Lens spaces

This page was built for publication: Estimating Matveev's complexity via crystallization theory

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