On f-vectors of Minkowski additions of convex polytopes

Abstract

The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with their own dual. In particular, we have a characterization of face lattice of the sum in terms of the face lattice of a given perfectly centered polytope. Exact face counting formulas are then obtained for perfectly centered simplices and hypercubes. The second type of results concerns tight upper bounds for the f-vectors of Minkowski sums of several polytopes.

13 pages, submitted to Discrete & Computational Geometry

Cited by in corpus (10)

• Topological obstructions for vertex numbers of Minkowski sums
• Minkowski Sum Construction and other Applications of Arrangements of Geodesic Arcs on the Sphere
• Diameter, decomposability, and Minkowski sums of polytopes
• Tight lower bounds on the number of faces of the Minkowski sum of convex polytopes via the Cayley trick
• Embedding Formulations and Complexity for Unions of Polyhedra
• Antiprismless, or: Reducing Combinatorial Equivalence to Projective Equivalence in Realizability Problems for Polytopes
• Maximal f-vectors of Minkowski sums of large numbers of polytopes
• Minimal Representations of Tropical Rational Functions
• Real zeros of mixed random fewnomial systems
• A linear equation for Minkowski sums of polytopes relatively in general position