Lefschetz and Lower Bound theorems for Minkowski sums
Karim Adiprasito

TL;DR
This paper establishes Lefschetz and lower bound theorems for Minkowski sums of polytopes, extending geometric combinatorics theory with new bounds and topological insights.
Contribution
It introduces a Lefschetz theorem specific to Minkowski sums and derives lower bound theorems, advancing the understanding of polytope combinatorics.
Findings
Lefschetz theorem for Minkowski sums of polytopes
Lower bound theorems for Minkowski sums
Extension of geometric combinatorics results
Abstract
This note provides a Lefschetz theorem for Minkowski sums of polytopes, and conclude lower bound theorems for Minkowski sums of polytopes. It is written as an appendix to arXiv:1405.7368, so notation and references follow that paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Advanced Combinatorial Mathematics · Computational Geometry and Mesh Generation
