Maximal f-vectors of Minkowski sums of large numbers of polytopes (Q411394)

When we take a Minkowski sum of polytopes such that the number of summands is less than the dimension then the trivial upper bound on the number of the vertices, obtained by taking the product of the number of vertices in each summand, is tight. This paper studies Minkowski sums of polytopes whose number is large, i.e., it exceeds the dimension. Generalizing the methods presented in [\textit{E. Fogel, D. Halperin} and \textit{C. Weibel}, Discrete Comput. Geom. 42, No. 4, 654--669 (2009; Zbl 1207.52012)], the paper presents a linear relation between the face numbers of a Minkowski sum of a large number of polytopes. Using this relation, the paper deduces a tight bound on the maximum number of vertices of a Minkowski sum of a large number of polytopes.