Criteria for strict monotonicity of the mixed volume of convex polytopes

DOI10.1515/ADVGEOM-2018-0024zbMATH Open1428.52011arXiv1702.07676OpenAlexW2963464815WikidataQ127597061 ScholiaQ127597061MaRDI QIDQ2334550FDOQ2334550

Authors: Ivan Soprunov, Frédéric Bihan 

Publication date: 7 November 2019

Published in: advg (Search for Journal in Brave)

Abstract: Let $P_1,dots,P_n$ and $Q_1,dots,Q_n$ be convex polytopes in $mathbb{R}^n$ such that $P_{i}subset{Q}_i$. It is well-known that the mixed volume has the monotonicity property: $V(P_1,dots,P_n)leqV(Q_1,dots,Q_n)$. We give two criteria for when this inequality is strict in terms of essential collections of faces as well as mixed polyhedral subdivisions. This geometric result allows us to characterize sparse polynomial systems with Newton polytopes $P_1,dots,P_n$ whose number of isolated solutions equals the normalized volume of the convex hull of $P_{1}cupdotscup{P}_n$. In addition, we obtain an analog of Cramer's rule for sparse polynomial systems.

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

Recommendations

• Unmixing the mixed volume computation
• Volume of convex polytopes equals mixed volume of simplices
• Theoretical aspects of mixed volume computation via mixed subdivision
• Mixed volumes of polytopes
• On the Newton polytope of the resultant

zbMATH Keywords

mixed volumeNewton polytopeBKK boundsparse polynomial systemBrunn-Minkowsky theory

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Mixed volumes and related topics in convex geometry (52A39) Solving polynomial systems; resultants (13P15)

Cites Work

• Using Algebraic Geometry
• Convex Bodies The Brunn-MinkowskiTheory
• The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
• On the Newton polytope of the resultant
• Newton polyhedra and the genus of complete intersections
• A Polyhedral Method for Solving Sparse Polynomial Systems
• The number of roots of a system of equations
• Intersection multiplicity numbers between tropical hypersurfaces
• Systems of equations with a single solution
• A convex geometric approach to counting the roots of a polynomial system
• Bézout inequality for mixed volumes
• Unmixing the mixed volume computation

Cited In (6)

• Unmixing the mixed volume computation
• The Maximum Likelihood Degree of Sparse Polynomial Systems
• Dimension results for extremal-generic polynomial systems over complete toric varieties
• Polyhedra of small relative mixed volume
• Mixed volume of small reaction networks
• Curve valuations and mixed volumes in the implicitization of rational varieties

Uses Software

• libtropicana

This page was built for publication: Criteria for strict monotonicity of the mixed volume of convex polytopes

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