Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams (Q439303): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 5 users not shown) | |||
Property / author | |||
Property / author: Paola Cristofori / rank | |||
Property / author | |||
Property / author: Paola Cristofori / rank | |||
Normal rank | |||
Property / review text | |||
Matveev complexity assigns a non-negative integer \(c(M)\) to each compact, connected 3--manifold \(M\), such that there are only finitely many manifolds with any given complexity. This complexity is also additive under connected sum. The paper under review considers two other complexity measures on compact 3--manifolds. The modified Heegaard complexity \(c_{HM}(M)\) is defined in terms of the number of intersection points of curves in Heegaard diagrams for \(M\). It was known that this gives an upper bound on \(c(M)\) provided \(M\) is orientable. It is noted that the proof of this by \textit{A. Cattabriga, M. Mulazzani} and \textit{A. Vesnin} [J. Korean Math. Soc. 47, 585--599 (2010; Zbl 1198.57014)] also holds in the non-orientable case. The Gem--Matveev complexity \(c'(M)\), which is defined only when \(M\) is closed, is defined in terms of the number of vertices in a crystallization of \(M\). A crystallization of \(M\) is a 4--coloured graph that encodes a particular construction of \(M\) using tetrahedra. This paper first recalls the definitions of \(c(M)\), \(c_{HM}(M)\) and \(c'(M)\). Next it is proved that if \(M\) is a closed connected 3--manifold then \(c_{HM}(M)=c'(M)\). Finally, the authors conjecture that \(c(M)=c_{HM}(M)=c'(M)\) for any closed, connected 3--manifold \(M\). | |||
Property / review text: Matveev complexity assigns a non-negative integer \(c(M)\) to each compact, connected 3--manifold \(M\), such that there are only finitely many manifolds with any given complexity. This complexity is also additive under connected sum. The paper under review considers two other complexity measures on compact 3--manifolds. The modified Heegaard complexity \(c_{HM}(M)\) is defined in terms of the number of intersection points of curves in Heegaard diagrams for \(M\). It was known that this gives an upper bound on \(c(M)\) provided \(M\) is orientable. It is noted that the proof of this by \textit{A. Cattabriga, M. Mulazzani} and \textit{A. Vesnin} [J. Korean Math. Soc. 47, 585--599 (2010; Zbl 1198.57014)] also holds in the non-orientable case. The Gem--Matveev complexity \(c'(M)\), which is defined only when \(M\) is closed, is defined in terms of the number of vertices in a crystallization of \(M\). A crystallization of \(M\) is a 4--coloured graph that encodes a particular construction of \(M\) using tetrahedra. This paper first recalls the definitions of \(c(M)\), \(c_{HM}(M)\) and \(c'(M)\). Next it is proved that if \(M\) is a closed connected 3--manifold then \(c_{HM}(M)=c'(M)\). Finally, the authors conjecture that \(c(M)=c_{HM}(M)=c'(M)\) for any closed, connected 3--manifold \(M\). / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jessica E. Banks / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 57M27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 57N10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 57M15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6066687 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complexity of 3-manifolds | |||
Property / zbMATH Keywords: complexity of 3-manifolds / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Heegaard diagrams | |||
Property / zbMATH Keywords: Heegaard diagrams / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
crystallizations | |||
Property / zbMATH Keywords: crystallizations / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2090133103 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1203.0183 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-orientable 3-manifolds of small complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-orientable 3-manifolds of complexity up to 7 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5290132 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NON-ORIENTABLE 3-MANIFOLDS ADMITTING COLORED TRIANGULATIONS WITH AT MOST 30 TETRAHEDRA / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4648919 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration of non-orientable 3-manifolds using face-pairing graphs and union-find / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification of nonorientable 3-manifolds admitting decompositions into \(\leqq 26\) coloured tetrahedra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing Matveev's complexity of non-orientable 3-manifolds via crystallization theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Estimating Matveev's complexity via crystallization theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computing Matveev's complexity via crystallization theory: the orientable case / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: COMPLEXITY, HEEGAARD DIAGRAMS AND GENERALIZED DUNWOODY MANIFOLDS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A graph-theoretical representation of PL-manifolds -- a survey on crystallizations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extending the Concept of Genus to Dimension N / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4114528 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3266916 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal triangulations for an infinite family of lens spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Coverings and minimal triangulations of 3-manifolds / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4857345 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Three-Manifolds Having Complexity At Most 9 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: TRANSFORMATIONS OF SPECIAL SPINES AND THE ZEEMAN CONJECTURE / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity theory of three-dimensional manifolds / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer classification of 3-manifolds. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tabulation of three-dimensional manifolds / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic topology and classification of 3-manifolds / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: TWO-SIDED ASYMPTOTIC BOUNDS FOR THE COMPLEXITY OF SOME CLOSED HYPERBOLIC THREE-MANIFOLDS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3825758 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two-sided bounds for the complexity of cyclic branched coverings of two-bridge links / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4156452 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:11, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams |
scientific article |
Statements
Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams (English)
0 references
16 August 2012
0 references
Matveev complexity assigns a non-negative integer \(c(M)\) to each compact, connected 3--manifold \(M\), such that there are only finitely many manifolds with any given complexity. This complexity is also additive under connected sum. The paper under review considers two other complexity measures on compact 3--manifolds. The modified Heegaard complexity \(c_{HM}(M)\) is defined in terms of the number of intersection points of curves in Heegaard diagrams for \(M\). It was known that this gives an upper bound on \(c(M)\) provided \(M\) is orientable. It is noted that the proof of this by \textit{A. Cattabriga, M. Mulazzani} and \textit{A. Vesnin} [J. Korean Math. Soc. 47, 585--599 (2010; Zbl 1198.57014)] also holds in the non-orientable case. The Gem--Matveev complexity \(c'(M)\), which is defined only when \(M\) is closed, is defined in terms of the number of vertices in a crystallization of \(M\). A crystallization of \(M\) is a 4--coloured graph that encodes a particular construction of \(M\) using tetrahedra. This paper first recalls the definitions of \(c(M)\), \(c_{HM}(M)\) and \(c'(M)\). Next it is proved that if \(M\) is a closed connected 3--manifold then \(c_{HM}(M)=c'(M)\). Finally, the authors conjecture that \(c(M)=c_{HM}(M)=c'(M)\) for any closed, connected 3--manifold \(M\).
0 references
complexity of 3-manifolds
0 references
Heegaard diagrams
0 references
crystallizations
0 references
0 references
0 references
0 references