# Lectures on Polytopes

@inproceedings{Ziegler1994LecturesOP,
title={Lectures on Polytopes},
author={G{\"u}nter M. Ziegler},
year={1994}
}
Based on a graduate course given at the Technische Universitat, Berlin, these lectures present a wealth of material on the modern theory of convex polytopes. The clear and straightforward presentation features many illustrations, and provides complete proofs for most theorems. The material requires only linear algebra as a prerequisite, but takes the reader quickly from the basics to topics of recent research, including a number of unanswered questions. The lectures - introduce the basic facts…
3,254 Citations
Topics in algorithmic, enumerative and geometric combinatorics
This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on
Lectures on 0/1-Polytopes
These lectures on the combinatorics and geometry of 0/1-polytopes are meant as an introduction and invitation. Rather than heading for an extensive survey on 0/1polytopes I present some interesting
Lattice Points, Polyhedra, and Complexity
• Mathematics
• 2004
Introduction The central topic of these lectures is efficient counting of integer points in poly-hedra. Consequently, various structural results about polyhedra and integer points are ultimately
A SAMPLE OF POLYHEDRAL METHODS IN COMPUTATIONAL ALGEBRAIC GEOMETRY
1 Introduccion These expository notes present several examples of how combinatorial methods can be used in Algebraic Geometry. The rst part describes the state and secondary polytopes and how they
Thesis for the Degree of Licentiate of Philosophy Enumeration on words , complexes and polytopes
This thesis presents four papers, studying enumerative problems on combinatorial structures. The first paper studies Forman’s discrete Morse theory in the case where a group acts on the underlying
Recent progress on the combinatorial diameter of polytopes and simplicial complexes
The Hirsch Conjecture, posed in 1957, stated that the graph of a d-dimensional polytope or polyhedron with n facets cannot have diameter greater than n−d. The conjecture itself has been disproved,
Embeddings of Polytopes and Polyhedral Complexes
Author(s): Wilson, Stedman | Advisor(s): Pak, Igor | Abstract: When does a topological polyhedral complex (embedded in Rd) admit a geometric realization (a rectilinear embedding in Rd)? What are the
A Polytopal Generalization of Sperner's Lemma
• Computer Science, Mathematics
J. Comb. Theory, Ser. A
• 2002
This work provides two proofs of the following conjecture: a non-constructive proof introducing the notion of a pebble set of a polytope, and a constructive proof using a path-following argument.
Monograph
Preface For every mathematician, ring theory and K-theory are intimately connected: algebraic K-theory is largely the K-theory of rings. At first sight, polytopes, by their very nature, must appear
Hypergraph Polytopes
• Mathematics
• 2010
We investigate a family of polytopes introduced by E.M. Feichtner, A. Postnikov and B. Sturmfels, which were named nestohedra. The vertices of these polytopes may intuitively be understood as

## References

SHOWING 1-4 OF 4 REFERENCES
Oriented matroids with few mutations
This paper defines a “connected sum” operation on oriented matroids of the same rank as well as constructing an arrangement of 20 pseudoplanes where one plane is not adjacent to any simplicial region and disproving the “strong-map conjecture” of Las Vergnas.
Rigidity and the lower bound theorem 1
SummaryFor an arbitrary triangulated (d-1)-manifold without boundaryC withf0 vertices andf1 edges, define \gamma (C) = f_1 - df_0 + \left( {\begin{array}{*{20}c} {d + 1} \\ 2 \\ \end{array} }