
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
An Invitation to Computational Homotopy is an introduction to elementary algebraic topology for those with an interest in computers and computer programming. It expertly illustrates how the basics of the subject can be implemented on a computer through its focus on fully-worked examples designed to develop problem solving techniques. The transition from basic theory to practical computation raises a range of non-trivial algorithmic issues which will appeal to readers already familiar with basic theory and who are interested in developing computational aspects. The book covers a subset of standard introductory material on fundamental groups, covering spaces, homology, cohomology and classifying spaces as well as some less standard material on crossed modules. These topics are covered in a way that hints at potential applications of topology in areas of computer science and engineering outside the usual territory of pure mathematics, and also in a way that demonstrates how computers can be used to perform explicit calculations within the domain of pure algebraic topology itself. The initial chapters include in-depth examples from data mining, biology and digital image analysis, while the later chapters cover a range of computational examples on the cohomology of classifying spaces that are likely beyond the reach of a purely paper-and-pen approach to the subject. An Invitation to Computational Homotopy serves as a self-contained and informal introduction to these topics and their implementation in the sphere of computer science. Written in a dynamic and engaging style, it skilfully showcases a range of useful machine computations, and will serve as an invaluable aid to graduate students working with algebraic topology.
This text investigates the intersection of algebraic topology and computational implementation, addressing the core question of how abstract topological concepts can be rendered into practical, machine-executable algorithms. Graham J. Ellis, a mathematician with expertise in algebraic topology, provides a framework that bridges the gap between theoretical definitions and explicit computer-based calculations. By utilizing a series of worked examples, the author argues that computational methods not only facilitate complex topological analysis but also extend the reach of the field into applied domains like data mining and digital image analysis.
What You Will Find
Scope Limits
Experts and graduate students recognize this work as a specialized resource for those seeking to apply computational techniques to pure mathematical problems. Readers frequently note the balance between theoretical rigor and the practical utility of the provided algorithmic examples.
Page Count:
560
Publication Date:
2019-01-01
Publisher:
OUP Oxford
ISBN-10:
0192569414
ISBN-13:
9780192569417
No comments yet. Be the first to share your thoughts!