Abstract
Homology is a very powerful tool in that it allows one to draw conclusions about global properties of spaces and maps from local computations. It also involves a wonderful mixture of algebra, combinatorics, computation, and topology. Each of these subjects is, of course, interesting in its own right and appears as the subject of multiple sections in this book. But our primary objective is to see how they can be combined to produce homology, how homology can be computed efficiently, and how homology provides us with information about the geometry and topology of nonlinear objects and functions. Given the amount of theory that needs to be developed, it is easy to lose sight of these objectives along the way.
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
© 2004 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Kaczynski, T., Mischaikow, K., Mrozek, M. (2004). Preview. In: Computational Homology. Applied Mathematical Sciences, vol 157. Springer, New York, NY. https://doi.org/10.1007/0-387-21597-2_1
Download citation
DOI: https://doi.org/10.1007/0-387-21597-2_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-2354-7
Online ISBN: 978-0-387-21597-6
eBook Packages: Springer Book Archive