DataCite
metadata only
Minkowski sums of polytopes : combinatorics and computation
Minkowski sums are a very simple geometrical operation, with applications in many different fields. In particular, Minkowski sums of polytopes have shown to be of interest to both industry and the academic world. This thesis presents a study of these sums, both on combinatorial properties and on com
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On Smooth Combinatorial Products of Simplices#1051674
- The Four Color Theorem meets Shapes of Polyhedra#1118521
- Ehrhart Properties under Operations on Lattice Polytopes#1202757
- Positive formulas for q-Zeta numerators of Ferrers-cell posets#1050955
- Relative Ehrhart functions: eventual polynomiality and dualities#1381363
Record · ID 1381653
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive