On the universal partition theorem for 4-polytopes

DOI10.1007/PL00009367zbMath0914.52004OpenAlexW2022806840MaRDI QIDQ1389169

D. Massart

Publication date: 21 June 1999

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009367

zbMATH Keywords

convex polytopesemialgebraic setuniversality theoremstable equivalence4-polytoperealization spaceuniversal partition theoremvon Staudt construction

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Semialgebraic sets and related spaces (14P10) Algebraization in linear incidence geometry (51A25)

Related Items (1)

Nonrational configurations, polytopes, and surfaces

This page was built for publication: On the universal partition theorem for 4-polytopes