Computing Matveev's complexity via crystallization theory: the orientable case
M. R. Casali, P. Cristofori
Abstract
By means of a slight modification of the notion of GM-complexity, the present paper performs a graph-theoretical approach to the computation of (Matveev's) complexity for closed orientable 3-manifolds. In particular, the existing crystallization catalogue C28, due to Lins, is used to obtain upper bounds for the complexity of closed orientable 3-manifolds triangulated by at most 28 tetrahedra. The experimental results actually coincide with the exact values of complexity, for all but three elements. Moreover, in the case of at most 26 tetrahedra, the exact value of the complexity is shown to be always directly computable via crystallization theory.
Create a lesson
Related papers
Combinatorial Goussarov-Polyak-Viro Formulas for the Linking Number and Low Degree Coefficients of the Conway Polynomial
Nancy Scherich, Nathaniel Song
The flip symmetry on Khovanov-Rozansky homology
Hongjian Yang
Families of knots that cannot be made Legendrian parametrically
Javier Martínez-Aguinaga
Branched real projective structures on surfaces and geometrisation of representations
Gianluca Faraco, Nicholas Rungi
Generating the twist subgroup of the level 2 mapping class group of a non-orientable closed surface
Ryoma Kobayashi
H-cobordisms, infinite cyclic covers, and real Seiberg--Witten theory
Sungkyung Kang, JungHwan Park, Masaki Taniguchi