Papers
Topics
Authors
Recent
Search
2000 character limit reached

Inequalities between mixed volumes of convex bodies: volume bounds for the Minkowski sum

Published 8 Feb 2020 in math.MG and math.AG | (2002.03065v2)

Abstract: In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a function of order $O(m{2d})$, where $m$ is the mixed volume of the tuple $(P_1,\dots,P_d)$. 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 $O(md)$, 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.

Citations (5)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.