Criteria for strict monotonicity of the mixed volume of convex polytopes
From MaRDI portal
Publication:2334550
Abstract: Let and be convex polytopes in such that . It is well-known that the mixed volume has the monotonicity property: . 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 whose number of isolated solutions equals the normalized volume of the convex hull of . In addition, we obtain an analog of Cramer's rule for sparse polynomial systems.
Recommendations
Cites work
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A convex geometric approach to counting the roots of a polynomial system
- Bézout inequality for mixed volumes
- Convex Bodies The Brunn-MinkowskiTheory
- Intersection multiplicity numbers between tropical hypersurfaces
- Newton polyhedra and the genus of complete intersections
- On the Newton polytope of the resultant
- Systems of equations with a single solution
- The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings
- The number of roots of a system of equations
- Unmixing the mixed volume computation
- Using Algebraic Geometry
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
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)