f-vectors of Minkowski additions of convex polytopes

DOI10.1007/S00454-007-1310-2zbMATH Open1125.52009arXivmath/0510470OpenAlexW2112785014MaRDI QIDQ2369928FDOQ2369928

Authors: Komei Fukuda, Christophe Weibel 

Publication date: 21 June 2007

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0510470

Recommendations

• Maximal f-vectors of Minkowski sums of large numbers of polytopes
• On the exact maximum complexity of Minkowski sums of polytopes
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes

zbMATH Keywords

dualpolytope\(f\)-vectorMinkowski sumperfectly centred

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11)

Cited In (22)

• Real zeros of mixed random fewnomial systems
• Minimal representations of tropical rational functions
• A linear equation for Minkowski sums of polytopes relatively in general position
• Antiprismlessness, or: reducing combinatorial equivalence to projective equivalence in realizability problems for polytopes
• Classes of convex polyhedra closed under Minkowski addition
• The Minkowski sum of simplices in 3-dimensional space. An analytical description
• On the hardness of computing intersection, union and Minkowski sum of polytopes
• A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
• Maximal f-vectors of Minkowski sums of large numbers of polytopes
• Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
• Parity representations of posets
• The anticanonical complex for non-degenerate toric complete intersections
• Diameter, decomposability, and Minkowski sums of polytopes
• Minkowski summands of cubes
• Topological obstructions for vertex numbers of Minkowski sums
• On the exact maximum complexity of Minkowski sums of polytopes
• Some enumeration relating to intervals in posets
• Dual-antiprisms and partitions of powers of 2 into powers of 2
• The aggregate capacity of virtual resources – linear models
• Additive structures on \(f\)-vector sets of polytopes
• The flag polynomial of the Minkowski sum of simplices
• \(f\)-vectors of polyhedra

This page was built for publication: \(f\)-vectors of Minkowski additions of convex polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369928)