This welcome boon for students of algebraic topology cuts a much-needed central path between other texts whose treatment of the classification theorem for compact surfaces is either too formalized and complex for those without detailed background knowledge, or too informal to afford students a comprehensive insight into the subject. Its dedicated, student-centred approach details a near-complete proof of this theorem, widely admired for its efficacy and formal beauty. The authors present the technical tools needed to deploy the method effectively as well as demonstrating their use in a clearly structured, worked example. Ideal for students whose mastery of algebraic topology may be a work-in-progress, the text introduces key notions such as fundamental groups, homology groups, and the Euler-Poincaré characteristic. These prerequisites are the subject of detailed appendices that enable focused, discrete learning where it is required, without interrupting the carefully planned structure of the core exposition. Gently guiding readers through the principles, theory, and applications of the classification theorem, the authors aim to foster genuine confidence in its use and in so doing encourage readers to move on to a deeper exploration of the versatile and valuable techniques available in algebraic topology.
Excellent text covers vector fields, plane homology and the Jordan Curve Theorem, surfaces, homology of complexes, more. Problems and exercises. Some knowledge of differential equations and multivariate calculus required.Bibliography. 1979 edition.
What a wonderful book! I strongly recommend this book to anyone, especially graduate students, interested in getting a sense of 4-manifolds. --MAA Reviews The book gives an excellent overview of 4-manifolds, with many figures and historical notes. Graduate students, nonexperts, and experts alike will enjoy browsing through it. -- Robion C. Kirby, University of California, Berkeley This book offers a panorama of the topology of simply connected smooth manifolds of dimension four. Dimension four is unlike any other dimension; it is large enough to have room for wild things to happen, but small enough so that there is no room to undo the wildness. For example, only manifolds of dimension four can exhibit infinitely many distinct smooth structures. Indeed, their topology remains the least understood today. To put things in context, the book starts with a survey of higher dimensions and of topological 4-manifolds. In the second part, the main invariant of a 4-manifold--the intersection form--and its interaction with the topology of the manifold are investigated. In the third part, as an important source of examples, complex surfaces are reviewed. In the final fourth part of the book, gauge theory is presented; this differential-geometric method has brought to light how unwieldy smooth 4-manifolds truly are, and while bringing new insights, has raised more questions than answers. The structure of the book is modular, organized into a main track of about two hundred pages, augmented by extensive notes at the end of each chapter, where many extra details, proofs and developments are presented. To help the reader, the text is peppered with over 250 illustrations and has an extensive index.
Geometric topology may roughly be described as the branch of the topology of manifolds which deals with questions of the existence of homeomorphisms. Only in fairly recent years has this sort of topology achieved a sufficiently high development to be given a name, but its beginnings are easy to identify. The first classic result was the SchOnflies theorem (1910), which asserts that every 1-sphere in the plane is the boundary of a 2-cell. In the next few decades, the most notable affirmative results were the "Schonflies theorem" for polyhedral 2-spheres in space, proved by J. W. Alexander [Ad, and the triangulation theorem for 2-manifolds, proved by T. Rad6 [Rd. But the most striking results of the 1920s were negative. In 1921 Louis Antoine [A ] published an extraordinary paper in which he 4 showed that a variety of plausible conjectures in the topology of 3-space were false. Thus, a (topological) Cantor set in 3-space need not have a simply connected complement; therefore a Cantor set can be imbedded in 3-space in at least two essentially different ways; a topological 2-sphere in 3-space need not be the boundary of a 3-cell; given two disjoint 2-spheres in 3-space, there is not necessarily any third 2-sphere which separates them from one another in 3-space; and so on and on. The well-known "horned sphere" of Alexander [A ] appeared soon thereafter.
Since the times of Gauss, Riemann, and Poincare, one of the principal goals of the study of manifolds has been to relate local analytic properties of a manifold with its global topological properties. Among the high points on this route are the Gauss-Bonnet formula, the de Rham complex, and the Hodge theorem; these results show, in particular, that the central tool in reaching the main goal of global analysis is the theory of differential forms. This book is a comprehensive introduction to differential forms. It begins with a quick presentation of the notion of differentiable manifolds and then develops basic properties of differential forms as well as fundamental results about them, such as the de Rham and Frobenius theorems. The second half of the book is devoted to more advanced material, including Laplacians and harmonic forms on manifolds, the concepts of vector bundles and fiber bundles, and the theory of characteristic classes. Among the less traditional topics treated in the book is a detailed description of the Chern-Weil theory. With minimal prerequisites, the book can serve as a textbook for an advanced undergraduate or a graduate course in differential geometry.
Processing: Creative Coding and Generative Art in Processing 2 is a fun and creative approach to learning programming. Using the easy to learn Processing programming language, you will quickly learn how to draw with code, and from there move to animating in 2D and 3D. These basics will then open up a whole world of graphics and computer entertainment. If you’ve been curious about coding, but the thought of it also makes you nervous, this book is for you; if you consider yourself a creative person, maybe worried programming is too non-creative, this book is also for you; if you want to learn about the latest Processing 2.0 language release and also start making beautiful code art, this book is also definitely for you. You will learn how to develop interactive simulations, create beautiful visualizations, and even code image-manipulation applications. All this is taught using hands-on creative coding projects. Processing 2.0 is the latest release of the open-source Processing language, and includes exciting new features, such as OpenGL 2 support for enhanced 3D graphics performance. Processing: Creative Coding and Generative Art in Processing 2 is designed for independent learning and also as a primary text for an introductory computing class. Based on research funded by the National Science Foundation, this book brings together some of the most engaging and successful approaches from the digital arts and computer science classrooms. Teaches you how to program using a fun and creative approach. Covers the latest release of the Processing 2.0 language. Presents a research based approach to learning computing.
The essentials of point-set topology, complete with motivation and numerous examples Topology: Point-Set and Geometric presents an introduction to topology that begins with the axiomatic definition of a topology on a set, rather than starting with metric spaces or the topology of subsets of Rn. This approach includes many more examples, allowing students to develop more sophisticated intuition and enabling them to learn how to write precise proofs in a brand-new context, which is an invaluable experience for math majors. Along with the standard point-set topology topics—connected and path-connected spaces, compact spaces, separation axioms, and metric spaces—Topology covers the construction of spaces from other spaces, including products and quotient spaces. This innovative text culminates with topics from geometric and algebraic topology (the Classification Theorem for Surfaces and the fundamental group), which provide instructors with the opportunity to choose which "capstone" best suits his or her students. Topology: Point-Set and Geometric features: A short introduction in each chapter designed to motivate the ideas and place them into an appropriate context Sections with exercise sets ranging in difficulty from easy to fairly challenging Exercises that are very creative in their approaches and work well in a classroom setting A supplemental Web site that contains complete and colorful illustrations of certain objects, several learning modules illustrating complicated topics, and animations of particularly complex proofs
A basic problem in computer vision is to understand the structure of a real world scene given several images of it. Techniques for solving this problem are taken from projective geometry and photogrammetry. Here, the authors cover the geometric principles and their algebraic representation in terms of camera projection matrices, the fundamental matrix and the trifocal tensor. The theory and methods of computation of these entities are discussed with real examples, as is their use in the reconstruction of scenes from multiple images. The new edition features an extended introduction covering the key ideas in the book (which itself has been updated with additional examples and appendices) and significant new results which have appeared since the first edition. Comprehensive background material is provided, so readers familiar with linear algebra and basic numerical methods can understand the projective geometry and estimation algorithms presented, and implement the algorithms directly from the book.
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.
Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.
This book is an introduction to manifolds at the beginning graduate level, and accessible to any student who has completed a solid undergraduate degree in mathematics. It contains the essential topological ideas that are needed for the further study of manifolds, particularly in the context of differential geometry, algebraic topology, and related fields. Although this second edition has the same basic structure as the first edition, it has been extensively revised and clarified; not a single page has been left untouched. The major changes include a new introduction to CW complexes (replacing most of the material on simplicial complexes in Chapter 5); expanded treatments of manifolds with boundary, local compactness, group actions, and proper maps; and a new section on paracompactness.
This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.
The discrepancy method is the glue that binds randomness and complexity. It is the bridge between randomized computation and discrepancy theory, the area of mathematics concerned with irregularities in distributions. The discrepancy method has played a major role in complexity theory; in particular, it has caused a mini-revolution of sorts in computational geometry. This book tells the story of the discrepancy method in a few short independent vignettes. It is a varied tale which includes such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on the sphere and modular forms, derandomization, convex hulls, Voronoi diagrams, linear programming and extensions, geometric sampling, VC-dimension theory, minimum spanning trees, linear circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained. In particular, background material in discrepancy theory is supplied as needed. Thus the book should appeal to students and researchers in computer science, operations research, pure and applied mathematics, and engineering.
Groups arise naturally as symmetries of geometric objects, and so groups can be used to understand geometry and topology. Conversely, one can study abstract groups by using geometric techniques and ultimately by treating groups themselves as geometric objects. This book explores these connections between group theory and geometry, introducing some of the main ideas of transformation groups, algebraic topology, and geometric group theory. The first half of the book introduces basic notions of group theory and studies symmetry groups in various geometries, including Euclidean, projective, and hyperbolic. The classification of Euclidean isometries leads to results on regular polyhedra and polytopes; the study of symmetry groups using matrices leads to Lie groups and Lie algebras. The second half of the book explores ideas from algebraic topology and geometric group theory. The fundamental group appears as yet another group associated to a geometric object and turns out to be a symmetry group using covering spaces and deck transformations. In the other direction, Cayley graphs, planar models, and fundamental domains appear as geometric objects associated to groups. The final chapter discusses groups themselves as geometric objects, including a gentle introduction to Gromov's theorem on polynomial growth and Grigorchuk's example of intermediate growth. The book is accessible to undergraduate students (and anyone else) with a background in calculus, linear algebra, and basic real analysis, including topological notions of convergence and connectedness. This book is a result of the MASS course in algebra at Penn State University in the fall semester of 2009.
This volume is a collection of surveys of research problems in topology and its applications. The topics covered include general topology, set-theoretic topology, continuum theory, topological algebra, dynamical systems, computational topology and functional analysis. * New surveys of research problems in topology * New perspectives on classic problems * Representative surveys of research groups from all around the world
As an introduction to fundamental geometric concepts and tools needed for solving problems of a geometric nature using a computer, this book fills the gap between standard geometry books, which are primarily theoretical, and applied books on computer graphics, computer vision, or robotics that do not cover the underlying geometric concepts in detail. Gallier offers an introduction to affine, projective, computational, and Euclidean geometry, basics of differential geometry and Lie groups, and explores many of the practical applications of geometry. Some of these include computer vision, efficient communication, error correcting codes, cryptography, motion interpolation, and robot kinematics. This comprehensive text covers most of the geometric background needed for conducting research in computer graphics, geometric modeling, computer vision, and robotics and as such will be of interest to a wide audience including computer scientists, mathematicians, and engineers.
Both classical geometry and modern differential geometry have been active subjects of research throughout the 20th century and lie at the heart of many recent advances in mathematics and physics. The underlying motivating concept for the present book is that it offers readers the elements of a modern geometric culture by means of a whole series of visually appealing unsolved (or recently solved) problems that require the creation of concepts and tools of varying abstraction. Starting with such natural, classical objects as lines, planes, circles, spheres, polygons, polyhedra, curves, surfaces, convex sets, etc., crucial ideas and above all abstract concepts needed for attaining the results are elucidated. These are conceptual notions, each built "above" the preceding and permitting an increase in abstraction, represented metaphorically by Jacob's ladder with its rungs: the 'ladder' in the Old Testament, that angels ascended and descended... In all this, the aim of the book is to demonstrate to readers the unceasingly renewed spirit of geometry and that even so-called "elementary" geometry is very much alive and at the very heart of the work of numerous contemporary mathematicians. It is also shown that there are innumerable paths yet to be explored and concepts to be created. The book is visually rich and inviting, so that readers may open it at random places and find much pleasure throughout according their own intuitions and inclinations. Marcel Berger is t he author of numerous successful books on geometry, this book once again is addressed to all students and teachers of mathematics with an affinity for geometry.
Computer Vision: Algorithms and Applications explores the variety of techniques commonly used to analyze and interpret images. It also describes challenging real-world applications where vision is being successfully used, both for specialized applications such as medical imaging, and for fun, consumer-level tasks such as image editing and stitching, which students can apply to their own personal photos and videos. More than just a source of “recipes,” this exceptionally authoritative and comprehensive textbook/reference also takes a scientific approach to basic vision problems, formulating physical models of the imaging process before inverting them to produce descriptions of a scene. These problems are also analyzed using statistical models and solved using rigorous engineering techniques. Topics and features: structured to support active curricula and project-oriented courses, with tips in the Introduction for using the book in a variety of customized courses; presents exercises at the end of each chapter with a heavy emphasis on testing algorithms and containing numerous suggestions for small mid-term projects; provides additional material and more detailed mathematical topics in the Appendices, which cover linear algebra, numerical techniques, and Bayesian estimation theory; suggests additional reading at the end of each chapter, including the latest research in each sub-field, in addition to a full Bibliography at the end of the book; supplies supplementary course material for students at the associated website, http://szeliski.org/Book/. Suitable for an upper-level undergraduate or graduate-level course in computer science or engineering, this textbook focuses on basic techniques that work under real-world conditions and encourages students to push their creative boundaries. Its design and exposition also make it eminently suitable as a unique reference to the fundamental techniques and current research literature in computer vision.