Geometric combinatorics is a branch of mathematics in general and combinatorics in particular. It includes a number of subareas such as polyhedral combinatorics (the study of faces of convex polyhedra), convex geometry (the study of convex sets, in particular combinatorics of their intersections), and discrete geometry, which in turn has many applications to computational geometry. Other important areas include metric geometry of polyhedra, such as the Cauchy theorem on rigidity of convex polytopes. The study of regular polytopes, Archimedean solids, and kissing numbers is also a part of geometric combinatorics. Special polytopes are also considered, such as the permutohedron, associahedron and Birkhoff polytope. Also studied are finite geometries.
Further reading
* Topics in Geometric Combinatorics
* Geometric Combinatorics, Edited by: Ezra Miller and Victor Reiner
* Combinatorics of Finite Geometries
Retrieved from "http://en.wikipedia.org/"
All text is available under the terms of the GNU Free Documentation License
