Abstract
Denote by M the set of all compact 3-manifolds. We wish to study it systematically and comprehensively. The crucial question is the choice of filtration in M. It would be desirable to have a finite number of 3-manifolds in each term of the filtration, all of them being in some sense simpler than those in the subsequent terms. A useful tool here would be a measure of “complexity” of a 3-manifold. Given such a measure, we might hope to enumerate all ‘simple’ manifolds before moving on to more complicated ones. There are several well-known candidates for such a complexity function. For example, take the Heegaard genus g(M), defined to be the minimal genus over all Heegaard decompositions of M. Other examples include the minimal number of sim-plices in a triangulation of M and the minimal crossing number in a surgery presentation for M.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Matveev, S. (2003). Complexity Theory of 3-Manifolds. In: Algorithmic Topology and Classification of 3-Manifolds. Algorithms and Computation in Mathematics, vol 9. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05102-3_2
Download citation
DOI: https://doi.org/10.1007/978-3-662-05102-3_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-05104-7
Online ISBN: 978-3-662-05102-3
eBook Packages: Springer Book Archive