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

DOI10.1112/MTK.12055zbMATH Open1524.52014arXiv2002.03065OpenAlexW3102349276MaRDI QIDQ6134985FDOQ6134985

Christopher Borger, Gennadiy Averkov, Ivan Soprunov

Publication date: 23 August 2023

Published in: Mathematika (Search for Journal in Brave)

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^{2^d})$, 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(m^d)$, 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.

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

Recommendations

• Volume inequalities for \(L_0\)-Minkowski combination of convex bodies
• On an inequality of Minkowski for mixed volumes
• Convex bodies: mixed volumes and inequalities
• scientific article
• scientific article; zbMATH DE number 1790531
• Improved \(L_p\)-mixed volume inequality for convex bodies
• Volume Inequalities and Additive Maps of Convex Bodies
• A geometric inequality on mixed volumes
• Inequalities between successive minima and intrinsic volumes of a convex body
• Some inequalities about mixed volumes

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Mixed volumes and related topics in convex geometry (52A39) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Cites Work

• polymake: a framework for analyzing convex polytopes
• Ideals, Varieties, and Algorithms
• Convex and Discrete Geometry
• Using Algebraic Geometry
• Normaliz: Algorithms for affine monoids and rational cones
• Convex Bodies The Brunn-MinkowskiTheory
• Multivariate Abel-Ruffini
• Systems of equations with a single solution
• Uniform cover inequalities for the volume of coordinate sections and projections of convex bodies
• Inequalities between mixed volumes of convex sets
• STEINER POLYNOMIALS VIA ULTRA-LOGCONCAVE SEQUENCES
• Galois theory for general systems of polynomial equations
• Classification of triples of lattice polytopes with a given mixed volume

Cited In (7)

• Title not available (Why is that?)
• A product formula for the normalized volume of free sums of lattice polytopes
• Mixed volumes for nonconvex bodies
• On an inequality of Minkowski for mixed volumes
• A geometric inequality on mixed volumes
• Classification of triples of lattice polytopes with a given mixed volume
• The volume polynomial of lattice polygons

This page was built for publication: INEQUALITIES BETWEEN MIXED VOLUMES OF CONVEX BODIES: VOLUME BOUNDS FOR THE MINKOWSKI SUM

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