Using the borsuk-ulam theorem lectures on topological methods in combinatorics and geometry universitext

Author:

Language: Anglais
Cover of the book Using the borsuk-ulam theorem lectures on topological methods in combinatorics and geometry universitext

Approximative price 73.84 €

In Print (Delivery period: 15 days).

Add to cartAdd to cart
Publication date:
196 p. · Paperback
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.
Preliminaries.- 1 Simplicial Complexes: 1.1 Topological space. 1.2 Homotopy equivalence and homotop. 1.3 Geometric simplicial complexe. 1.4 Triangulation. 1.5 Abstract simplicial complexe. 1.6 Dimension of geometric realization. 1.7 Simplicial complexes and posets.- 2 The Borsuk-Ulam Theorem: 2.1 The Borsuk-Ulam theorem in various guise. 2.2 A geometric proo. 2.3 A discrete version: Tucker's lemm. 2.4 Another proof of Tucker's lemma.- 3 Direct Applications of Borsuk--Ulam: 3.1 The ham sandwich theore. 3.2 On multicolored partitions and necklace. 3.3 Kneser's conjectur. 3.4 More general Kneser graphs: Dolnikov's theore. 3.5 Gale's lemma and Schrijver's theorem.- 4 A Topological Interlude: 4.1 Quotient space. 4.2 Joins (and products. 4.3 k-connectednes. 4.4 Recipes for showing k-connectednes. 4.5 Cell complexes.- 5 Z_2-Maps and Nonembeddability: 5.1 Nonembeddability theorems: An introductio. 5.2 Z_2-spaces and Z_2-map. 5.3 The Z_2-inde. 5.4 Deleted products good ... 5.5 ... deleted joins bette. 5.6 Bier spheres and the Van Kampen-Flores theore. 5.7 Sarkaria's inequalit. 5.8 Nonembeddability and Kneser coloring. 5.9 A general lower bound for the chromatic number.- 6 Multiple Points of Coincidence: 6.1 G-space. 6.2 E_nG spaces and the G-inde. 6.3 Deleted joins and deleted product. 6.4 Necklace for many thieve. 6.5 The topological Tverberg theore. 6.6 Many Tverberg partition. 6.7 Z_p-inde. Kneser coloring. and p-fold point. 6.8 The colored Tverberg theorem.- A Quick Summary.- Hints to Selected Exercises.- Bibliography.- Index.
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. This book is the first textbook treatment of a significant part of these 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. No prior knowledge of algebraic topology is assumed, only a background in undergraduate mathematics, and the required topological notions and results are gradually explained.