| Information | |
|---|---|
| has gloss | eng: Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher dimensional convex polytopes. |
| lexicalization | eng: polyhedral combinatorics |
| instance of | e/Polytope |
| Media | |
|---|---|
| media:img | Pyramid face lattice.svg |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint