Geometric combinatorics
 | This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. (November 2024) |
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.
See also
[edit]References
[edit]- What is geometric combinatorics?, Ezra Miller and Vic Reiner, 2004
- Topics in Geometric Combinatorics (PDF), 2004-08-13, archived from the original (PDF) on 2021-02-01
- Geometric Combinatorics, Edited by: Ezra Miller and Victor Reiner
.svg){kind=small} | This combinatorics-related article is a stub. You can help Wikipedia by adding missing information. |