arXiv Analytics

Sign in

arXiv:math/0103169 [math.GT]AbstractReferencesReviewsResources

Towards Lower Bounds for Complexity of 3-Manifolds: a Program

Sergei Anisov

Published 2001-03-26Version 1

For a 3-dimensional manifold $M^3$, its complexity $c(M^3)$, introduced by S.Matveev, is the minimal number of vertices of an almost simple spine of $M^3$; in many cases it is equal to the minimal number of tetrahedra in a singular triangulation of $M^3$. An approach to estimating $c(M^3)$ from below for total spaces of torus bundles over $S^1$, based on the study of theta-curves in the fibers, is developed, and pseudominimal special spines for these manifolds are constructed, which we conjecture to be their minimal spines. We also show how to apply some of these ideas to other 3-manifolds.

Comments: AMS-TeX, 43 pages, 22 figures
Categories: math.GT
Subjects: 52B05, 05C12, 52C20, 52B10, 57N10, 57R22
Related articles: Most relevant | Search more
arXiv:1811.02753 [math.GT] (Published 2018-11-07)
A note on the complexity of h-cobordisms
arXiv:0810.1221 [math.GT] (Published 2008-10-07)
Complexity of links in 3-manifolds
arXiv:math/0005104 [math.GT] (Published 2000-05-10, updated 2000-11-24)
3-Manifolds with complexity at most 9