Atnaujinkite slapukų nuostatas

Course in Topological Combinatorics 2013 ed. [Minkštas viršelis]

  • Formatas: Paperback / softback, 240 pages, aukštis x plotis: 235x155 mm, weight: 3869 g, XII, 240 p., 1 Paperback / softback
  • Serija: Universitext
  • Išleidimo metai: 15-Oct-2014
  • Leidėjas: Springer-Verlag New York Inc.
  • ISBN-10: 1489988262
  • ISBN-13: 9781489988263
Kitos knygos pagal šią temą:
  • Formatas: Paperback / softback, 240 pages, aukštis x plotis: 235x155 mm, weight: 3869 g, XII, 240 p., 1 Paperback / softback
  • Serija: Universitext
  • Išleidimo metai: 15-Oct-2014
  • Leidėjas: Springer-Verlag New York Inc.
  • ISBN-10: 1489988262
  • ISBN-13: 9781489988263
Kitos knygos pagal šią temą:

A Course in Topological Combinatorics is the first undergraduate textbook on the field of topological combinatorics, a subject that has become an active and innovative research area in mathematics over the last thirty years with growing applications in math, computer science, and other applied areas. Topological combinatorics is concerned with solutions to combinatorial problems by applying topological tools. In most cases these solutions are very elegant and the connection between combinatorics and topology often arises as an unexpected surprise.

The textbook covers topics such as fair division, graph coloring problems, evasiveness of graph properties, and embedding problems from discrete geometry. The text contains a large number of figures that support the understanding of concepts and proofs. In many cases several alternative proofs for the same result are given, and each chapter ends with a series of exercises. The extensive appendix makes the book completely self-contained.

The textbook is well suited for advanced undergraduate or beginning graduate mathematics students. Previous knowledge in topology or graph theory is helpful but not necessary. The text may be used as a basis for a one- or two-semester course as well as a supplementary text for a topology or combinatorics class.



This undergraduate textbook in topological combinatorics covers such topics as fair division, graph coloring problems, evasiveness of graph properties, and embedding problems from discrete geometry. Includes many figures and exercises.

Recenzijos

This book is an excellent introduction into the subject. The book contains a lot of figures and each chapter ends with a group of exercises which help the reader in understanding the hard constructions and proofs. The book may serve for a one- or two-semester undergraduate course depending on the preliminary knowledges of the students. (Jįnos Kincses, Acta Scientiarum Mathematicarum, Vol. 81 (3-4), 2015)

The present book presents a sequence of combinatorial themes which have shown an affinity for topological methods . This book is filled with extremely attractive mathematics and bringing topology into the play of combinatorics and graph theory is a wonderfully elegant manoeuvre. Here it is carried out coherently, and on a pretty grand scale, and we are thus afforded the opportunity to encounter (algebraic) topology in a very seductive uniform context. What a marvelous thing! (Michael Berg, MAA Reviews, July, 2013)

In the books four main chapters, Longueville (Univ. of Applied Sciences, Germany) addresses fair-division problems; graph coloring; graph property evasiveness; and embeddings and mappings. Basic results of algebraic topology already have powerful consequences for analysis, but the subjects arcana can look like art for arts sake. The authors charting of a novel application domain for a core subject makes this book an essential acquisition. Summing Up: Essential. Upper-division undergraduates and above. (D. V. Feldman, Choice, Vol. 50 (8), April, 2013)

Topological combinatorics is concerned with the applications of the many powerful techniques of algebraic topology to problems in combinatorics. The present book aims to give a clear and vivid presentation of some of the most beautiful and accessible results from the area. The text, based upon some courses by the author at Freie Universität Berlin, is designed for an advanced undergraduate student. (Hirokazu Nishimura, zbMATH, Vol. 1273, 2013)

1 Fair-Division Problems
1(36)
1.1 Brouwer's Fixed-Point Theorem and Sperner's Lemma
1(6)
1.2 Envy-Free Fair Division
7(4)
1.3 The Borsuk--Ulam Theorem and Tucker's Lemma
11(5)
1.4 A Generalization of Tucker's Lemma
16(5)
1.5 Consensus 1/2-Division
21(2)
1.6 The Borsuk--Ulam Property for General Groups
23(5)
1.7 Consensus 1/k-Division
28(9)
Exercises
31(6)
2 Graph-Coloring Problems
37(32)
2.1 The Kneser Conjecture
38(3)
2.2 Lovasz's Complexes
41(10)
2.3 A Conjecture by Lovasz
51(12)
2.4 Classes with Good Topological Lower Bounds for the Chromatic Number
63(6)
Exercises
67(2)
3 Evasiveness of Graph Properties
69(28)
3.1 Graph Properties and Their Complexity
69(13)
3.2 Evasiveness of Monotone Graph Properties
82(7)
3.3 Karp's Conjecture in the Prime-Power Case
89(3)
3.4 The Rivest--Vuillemin Theorem on Set Systems
92(5)
Exercises
93(4)
4 Embedding and Mapping Problems
97(48)
4.1 The Radon Theorems
97(1)
4.2 Deleted Joins and the Z2-Index
98(4)
4.3 Bier Spheres
102(2)
4.4 The van Kampen--Flores Theorem
104(2)
4.5 The Tverberg Problem
106(4)
4.6 An Obstruction to Graph Planarity
110(12)
4.7 Conway's Thrackles
122(23)
Exercises
142(3)
5 Appendix A: Basic Concepts from Graph Theory
145(18)
A.1 Graphs
145(7)
A.2 Graph Invariants
152(2)
A.3 Graph Drawings and Planarity
154(3)
A.4 Rotation Systems and Surface Embeddings
157(6)
Exercises
161(2)
6 Appendix B: Crash Course in Topology
163(36)
B.1 Some Set-Theoretic Topology
163(9)
B.2 Surfaces
172(2)
B.3 Simplicial Complexes
174(4)
B.4 Shellability of Simplicial Complexes
178(1)
B.5 Some Operations on Simplicial Complexes
179(2)
B 6 The Language of Category Theory
181(2)
B.7 Some Homological Algebra
183(3)
B.8 Axioms for Homology
186(2)
B.9 Simplicial Homology
188(11)
Exercises
194(5)
7 Appendix C: Partially Ordered Sets, Order Complexes, and Their Topology
199(10)
C.1 Partially Ordered Sets
199(2)
C.2 Order Complexes
201(2)
C.3 Shellability of Partial Orders
203(6)
Exercises
206(3)
8 Appendix D: Groups and Group Actions
209(10)
D.1 Groups
209(1)
D.2 Group Actions
210(4)
D.3 Topological G-Spaces
214(1)
D.4 Simplicial Group Actions
215(4)
Exercises
217(2)
9 Appendix E: Some Results and Applications from Smith Theory
219(10)
E.1 The Transfer Homomorphism
219(2)
E.2 Transformations of Prime Order
221(2)
E.3 A Dimension Estimate and the Euler Characteristic
223(3)
E.4 Homology Spheres and Disks
226(1)
E.5 Cyclic Actions and a Result by Oliver
227(2)
Exercises
228(1)
References 229(4)
Index 233
Mark de Longueville is professor of Mathematics at Hochschule für Technik und Wirtschaft Berlin and faculty member of the Berlin branch of New York University.