Concise, rigorous introduction to homology theory features applications to dimension theory and fixed-point theorems. Lucid coverage of the field includes examinations of complexes and their Betti groups, invariance of the Betti groups, and continuous mappings and fixed points. Proofs are presented in a complete and careful manner. A beneficial text for a graduate-level course, "this little book is an extremely valuable addition to the literature of algebraic topology." — The Mathematical Gazette.
This introduction to combinatorics, the foundation of the interaction between computer science and mathematics, is suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics. The four-part treatment begins with a section on counting and listing that covers basic counting, functions, decision trees, and sieving methods. The following section addresses fundamental concepts in graph theory and a sampler of graph topics. The third part examines a variety of applications relevant to computer science and mathematics, including induction and recursion, sorting theory, and rooted plane trees. The final section, on generating functions, offers students a powerful tool for studying counting problems. Numerous exercises appear throughout the text, along with notes and references. The text concludes with solutions to odd-numbered exercises and to all appendix exercises.
In recent years, many students have been introduced to topology in high school mathematics. Having met the Mobius band, the seven bridges of Konigsberg, Euler's polyhedron formula, and knots, the student is led to expect that these picturesque ideas will come to full flower in university topology courses. What a disappointment "undergraduate topology" proves to be! In most institutions it is either a service course for analysts, on abstract spaces, or else an introduction to homological algebra in which the only geometric activity is the completion of commutative diagrams. Pictures are kept to a minimum, and at the end the student still does nr~ understand the simplest topological facts, such as the rcason why knots exist. In my opinion, a well-balanced introduction to topology should stress its intuitive geometric aspect, while admitting the legitimate interest that analysts and algebraists have in the subject. At any rate, this is the aim of the present book. In support of this view, I have followed the historical development where practicable, since it clearly shows the influence of geometric thought at all stages. This is not to claim that topology received its main impetus from geometric recreations like the seven bridges; rather, it resulted from the l'isualization of problems from other parts of mathematics-complex analysis (Riemann), mechanics (Poincare), and group theory (Dehn). It is these connec tions to other parts of mathematics which make topology an important as well as a beautiful subject.
This is not a traditional work on topological graph theory. No current graph or voltage graph adorns its pages. Its readers will not compute the genus (orientable or non-orientable) of a single non-planar graph. Their muscles will not flex under the strain of lifting walks from base graphs to derived graphs. What is it, then? It is an attempt to place topological graph theory on a purely combinatorial yet rigorous footing. The vehicle chosen for this purpose is the con cept of a 3-graph, which is a combinatorial generalisation of an imbedding. These properly edge-coloured cubic graphs are used to classify surfaces, to generalise the Jordan curve theorem, and to prove Mac Lane's characterisation of planar graphs. Thus they playa central role in this book, but it is not being suggested that they are necessarily the most effective tool in areas of topological graph theory not dealt with in this volume. Fruitful though 3-graphs have been for our investigations, other jewels must be examined with a different lens. The sole requirement for understanding the logical development in this book is some elementary knowledge of vector spaces over the field Z2 of residue classes modulo 2. Groups are occasionally mentioned, but no expertise in group theory is required. The treatment will be appreciated best, however, by readers acquainted with topology. A modicum of topology is required in order to comprehend much of the motivation we supply for some of the concepts introduced.
This volume is the first comprehensive treatment of combinatorial algebraic topology in book form. The first part of the book constitutes a swift walk through the main tools of algebraic topology. Readers - graduate students and working mathematicians alike - will probably find particularly useful the second part, which contains an in-depth discussion of the major research techniques of combinatorial algebraic topology. Although applications are sprinkled throughout the second part, they are principal focus of the third part, which is entirely devoted to developing the topological structure theory for graph homomorphisms.
Algebraic topology is a basic part of modern mathematics, and some knowledge of this area is indispensable for any advanced work relating to geometry, including topology itself, differential geometry, algebraic geometry, and Lie groups. This book provides a detailed treatment of algebraic topology both for teachers of the subject and for advanced graduate students in mathematics either specializing in this area or continuing on to other fields. J. Peter May's approach reflects the enormous internal developments within algebraic topology over the past several decades, most of which are largely unknown to mathematicians in other fields. But he also retains the classical presentations of various topics where appropriate. Most chapters end with problems that further explore and refine the concepts presented. The final four chapters provide sketches of substantial areas of algebraic topology that are normally omitted from introductory texts, and the book concludes with a list of suggested readings for those interested in delving further into the field.
This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs.
Topology is a relatively young and very important branch of mathematics, which studies the properties of objects that are preserved through deformations, twistings, and stretchings. This book deals with the topology of curves and surfaces as well as with the fundamental concepts of homotopy and homology, and does this in a lively and well-motivated way. This book is well suited for readers who are interested in finding out what topology is all about.
