f-vectors of Minkowski additions of convex polytopes
A polytope \(P\) in \(\mathbb{R}^d\) with the origin in its interior is perfectly centred if each proper face \(F\) of \(P\) meets the normal cone to \(P\) at \(F\). This property is preserved by duality (polarity), since the normal cone to the dual \(P^*\) at its face \(F^{\mathrm{D}}\) corresponding to \(F\) is the cone spanned by \(F\). The authors first show that, if \(P\) is perfectly centred, then the proper faces of the Minkowski sum \(P + P^*\) are just the \(F + G^{\mathrm{D}}\), with \(F,G\) faces of \(P\) such that \(G \subseteq F\). They also investigate upper bounds for the numbers of faces of general Minkowski sums \(P_1 + \cdots + P_n\), in particular showing that, when \(d \geq 3\), it is possible to find \(d - 1\) polytopes whose sum attains the trivial upper bound for the number of vertices. A more restricted result holds for \(k\)-faces when \(d \geq 4\), and it is shown that, for \(3\)-polytopes \(P_1,\ldots,P_n\) in relatively general position, the three functions \(\varphi(\cdot) = 2f_0(\cdot) - f_1(\cdot)\), \(f_2(\cdot) - f_0(\cdot) + 2\) and \(f_1(\cdot) - 2f_0(\cdot) + 4\) (which are not independent) satisfy \(\varphi(P_1 + \cdots + P_n) = \varphi(P_1) + \cdots + \varphi(P_n)\).
- Topological obstructions for vertex numbers of Minkowski sums
- On the exact maximum complexity of Minkowski sums of polytopes
- \(f\)-vectors of polyhedra
- Dual-antiprisms and partitions of powers of 2 into powers of 2
- Parity representations of posets
- Additive structures on f-vector sets of polytopes
- The Minkowski sum of simplices in 3-dimensional space. An analytical description
- Antiprismlessness, or: reducing combinatorial equivalence to projective equivalence in realizability problems for polytopes
- The flag polynomial of the Minkowski sum of simplices
- Maximal f-vectors of Minkowski sums of large numbers of polytopes
- Classes of convex polyhedra closed under Minkowski addition
- Some enumeration relating to intervals in posets
- Relative Stanley-Reisner theory and upper bound theorems for Minkowski sums
- The aggregate capacity of virtual resources – linear models
- Diameter, decomposability, and Minkowski sums of polytopes
- The anticanonical complex for non-degenerate toric complete intersections
- Real zeros of mixed random fewnomial systems
- Minkowski summands of cubes
- Minimal representations of tropical rational functions
- A geometric approach for the upper bound theorem for Minkowski sums of convex polytopes
- On the hardness of computing intersection, union and Minkowski sum of polytopes
- A linear equation for Minkowski sums of polytopes relatively in general position
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)
