INEQUALITIES BETWEEN MIXED VOLUMES OF CONVEX BODIES: VOLUME BOUNDS FOR THE MINKOWSKI SUM

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum (Formula presented.) of d-dimensional lattice polytopes is bounded from above by a function of order (Formula presented.), where m is the mixed volume of the tuple (Formula presented.). This is a consequence of the well-known Aleksandrov–Fenchel inequality. Esterov also posed the problem of determining a sharper bound. We show how additional relations between mixed volumes can be employed to improve the bound to (Formula presented.), which is asymptotically sharp. We furthermore prove a sharp exact upper bound in dimensions 2 and 3. Our results generalize to tuples of arbitrary convex bodies with volume at least one. This paper relies extensively on colour figures. Some references to colour may not be meaningful in the printed version, and we refer the reader to the online version which includes the colour figures.