arXiv Analytics

Sign in

arXiv:math/0005104 [math.GT]AbstractReferencesReviewsResources

3-Manifolds with complexity at most 9

Bruno Martelli, Carlo Petronio

Published 2000-05-10, updated 2000-11-24Version 2

We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such manifold, by recognizing its canonical decomposition into Seifert fibred spaces and hyperbolic manifolds. The algorithm relies on the extension of Matveev's theory of complexity to the case of manifolds bounded by suitably marked tori, and on the notion of assembling of two such manifolds. We show that every manifold is an assembling of manifolds which cannot be further deassembled, and we prove that there are surprisingly few such manifolds up to complexity 9. Our most interesting experimental discovery is the following: there are 4 hyperbolic manifolds having complexity 9, and they turn out to be precisely the 4 closed hyperbolic manifolds of least known volume. All other manifolds having complexity at most 9 are graph manifolds.

Comments: 49 pages, 32 figures. This is a revised version of math.GT/0005104, accepted for publication in Experimental Mathematics. The main improvement is an intrinsic definition of "brick", in terms of manifolds rather than in terms of spines, and an extension of Matveev's complexity to manifolds bounded by suitably marked tori
Journal: Experimental Math. 10 (2001), 207-237.
Categories: math.GT
Subjects: 57M20, 57N10
Related articles: Most relevant | Search more
arXiv:math/0105034 [math.GT] (Published 2001-05-04)
A New Decomposition Theorem for 3-Manifolds
arXiv:math/0312329 [math.GT] (Published 2003-12-17)
Non-orientable 3-manifolds of complexity up to 7
arXiv:math/0112308 [math.GT] (Published 2001-12-31, updated 2002-01-03)
Homological properties of graph manifolds