This book presents a course in the geometry of convex polytopes in arbitrary dimension, suitable for an advanced undergraduate or beginning graduate student. The book starts with the basics of polytope theory. Schlegel and Gale diagrams are introduced as geometric tools to visualize polytopes in high dimension and to unearth bizarre phenomena in polytopes. The heart of the book is a treatment of the secondary polytope of a point configuration and its connections to the statepolytope of the toric ideal defined by the configuration. These polytopes are relatively recent constructs with numerous connections to discrete geometry, classical algebraic geometry, symplectic geometry, and combinatorics. The connections rely on Grobner bases of toric ideals and other methods fromcommutative algebra. The book is self-contained and does not require any background beyond basic linear algebra. With numerous figures and exercises, it can be used as a textbook for courses on geometric, combinatorial, and computational aspects of the theory of polytopes.

Geometric combinatorics describes a wide area of mathematics that is primarily the study of geometric objects and their combinatorial structure. This text is a compilation of expository articles at the interface between combinatorics and geometry.

The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.

Among the intuitively appealing aspects of graph theory is its close connection to drawings and geometry. The development of computer technology has become a source of motivation to reconsider these connections, in particular geometric graphs are emerging as a new subfield of graph theory. Arrangements of points and lines are the objects for many challenging problems and surprising solutions in combinatorial geometry. The book is a collection of beautiful and partly very recent results from the intersection of geometry, graph theory and combinatorics.

To the uninitiated, algebraic topology might seem fiendishly complex, but its utility is beyond doubt. This brilliant exposition goes back to basics to explain how the subject has been used to further our understanding in some key areas. 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.

Geometric combinatorics describes a wide area of mathematics that is primarily the study of geometric objects and their combinatorial structure. This text is a compilation of expository articles at the interface between combinatorics and geometry.

The main topics in this introductory text to discrete geometry include basics on convex sets, convex polytopes and hyperplane arrangements, combinatorial complexity of geometric configurations, intersection patterns and transversals of convex sets, geometric Ramsey-type results, and embeddings of finite metric spaces into normed spaces. In each area, the text explains several key results and methods.