arXiv:math/0510470 [math.CO]AbstractReferencesReviewsResources
On f-vectors of Minkowski additions of convex polytopes
Komei Fukuda, Christophe Weibel
Published 2005-10-21, updated 2006-11-02Version 4
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.
Comments: 13 pages, submitted to Discrete & Computational Geometry
Journal: Discrete & Computational Geometry, vol. 37 (2007), pp. 503-516
Categories: math.CO
Subjects: 52B05
Keywords: convex polytopes, minkowski additions, minkowski sum, results concerns tight upper bounds, face lattice
Tags: journal article
Related articles: Most relevant | Search more
arXiv:0911.4982 [math.CO] (Published 2009-11-25)
More bounds on the diameters of convex polytopes
Topological obstructions for vertex numbers of Minkowski sums
arXiv:2104.08135 [math.CO] (Published 2021-04-16)
Sharp bounds for the number of regions of maxout networks and vertices of Minkowski sums