【图书简介】 A number of important results in combinatorics， discrete geometry， and theoretical computer science have been proved using algebraic topology. While the results are quite famous， their proofs are not so widely understood. They are scattered in research papers or outlined in surveys， and they often use topological notions not commonly known among combinatorialists or computer scientists.This book is the first textbook treatment of a significant part of such results. It focuses on so-called equivariant methods， based on the Borsuk-Ulam theorem and its generalizations. The topological tools are intentionally kept on a very elementary level （for example， homology theory and homotopy groups are completely avoided）. No prior knowledge of algebraic topology is assumed， only a background in undergraduate mathematics， and the required topological notions and results are gradually explained. At the same time， many substantial combinatorial results are covered， sometimes with some of the most important results， such as Kneser's conjecture， showing them from various points of view.The history of the presented material， references， related results， and more advanced methods are surveyed in separate subsections. The text is accompanied by numerous exercises， of varying difficulty. Many of the exercises actually outline additional results that did not fit in the main text. The book is richly illustrated， and it has a detailed index and an extensive bibliography.This text started with a one-semester graduate course the author taught in fall 1993 in Prague. The transcripts of the lectures by the participants served as a basis of the first version. Some years later， a course partially based on that text was taught by Günter M. Ziegler in Berlin. The book is based on a thoroughly rewritten version prepared during a pre-doctoral course the author taught at the ETH Zurich in fall 2001.Most of the material was covered in the course： Chapter 1 was assigned as an introductory reading text， and the other chapters were presented in approximately 30 hours of teaching （by 45 minutes）， with some omissions throughout and with only a sketchy presentation of the last chapter.
【作者简介】 Jiri Matousek，born in 1963，is Professor of Computer Science at Charles University in Prague.He works mainly in discrete geometry and combinatorics.This is his fourth book.
【本书目录】 Preface Preliminaries 1 Simplicial Complexes Topological Spaces Homotopy Equivalence and Homotopy Geometric Simplicial Complexes Triangulations Abstract Simplicial Complexes Dimension of Geometric Realizations Simplicial Complexes and Posets 2 The Borsuk--Ulam Theorem The Borsuk--Ulam Theorem in Various Guises A Geometric Proof A Discrete Version: Tucker's Lemma Another Proof of Tucker's Lemma 3 Direct Applications of Borsuk--Ulam The Ham Sandwich Theorem On Multicolored Partitions and Necklaces Kneser's Conjecture More General Kneser Graphs: Dol'nikov's theorem Gale's Lemma and Schrijver's Theorem 4 A Topological Interlude Quotient Spaces Joins (and Products) k-Connectedness Recipes for Showing k-Connectedness Cell Complexes 5 Z2-Maps and Nonembeddability Nonembeddability Theorems: An Introduction Z2-Spaces and Z2-Maps The Z2-Index Deleted Products Good ...Deleted Joins Better Bier Spheres and the Van Kampen Flores Theorem Sarkaria's Inequality Nonembeddability and Kneser Colorings A General Lower Bound for the Chromatic Number 6 Multiple Points of Coincidence G-Spaces EnG Spaces and the G-Index Deleted Joins and Deleted Products Necklace for Many Thieves The Topological Tverberg Theorem Many Tverberg Partitions Zp-Index, Kneser Colorings, and p-Fold Points The Colored Tverberg Theorem A Quick Summary Hints to Selected Exercises References Index
【图书简介】
【购买本书】
