Computing Matveev's complexity via crystallization theory: the orientable case

Details Computing Matveev's complexity via crystallization theory: the orientable case Computing Matveev's complexity via crystallization theory: the orientable case

2004-11-29

arxiv.org/abs/math/0411633v4

Acta Appl. Math. 92(2), 113-123 (2006)

Mathematics

Geometric Topology

12 pages. This version contains several changes regarding definitions and some shortenings of statements and proofs. Also the

Scientific paper

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 C^{28}, 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.

Affiliated with

Also associated with

No associations

Rating

Computing Matveev's complexity via crystallization theory: the orientable case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing Matveev's complexity via crystallization theory: the orientable case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Matveev's complexity via crystallization theory: the orientable case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-449712