e/Polyhedral combinatorics

New Query

Information
has glosseng: 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.
lexicalizationeng: polyhedral combinatorics
instance ofe/Polytope
Media
media:imgPyramid face lattice.svg

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint