Abstract
We derive tight expressions for the maximum number of -faces, , of the Minkowski sum, , of convex -polytopes in , where and , as a (recursively defined) function on the number of vertices of the polytopes. Our results coincide with those recently proved by Adiprasito and Sanyal [2]. In contrast to Adiprasito and Sanyal's approach, which uses tools from Combinatorial Commutative Algebra, our approach is purely geometric and uses basic notions such as - and -vector calculus and shellings, and generalizes the methodology used in [15] and [14] for proving upper bounds on the -vector of the Minkowski sum of two and three convex polytopes, respectively. The key idea behind our approach is to express the Minkowski sum as a section of the Cayley polytope of the summands; bounding the -faces of reduces to bounding the subset of the -faces of that contain vertices from each of the polytopes. We end our paper with a sketch of an explicit construction that establishes the tightness of the upper bounds.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.