Criteria for strict monotonicity of the mixed volume of convex polytopes

From MaRDI portal
Publication:2334550




Abstract: Let P1,dots,Pn and Q1,dots,Qn be convex polytopes in mathbbRn such that PisubsetQi. It is well-known that the mixed volume has the monotonicity property: V(P1,dots,Pn)leqV(Q1,dots,Qn). 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 P1,dots,Pn whose number of isolated solutions equals the normalized volume of the convex hull of P1cupdotscupPn. In addition, we obtain an analog of Cramer's rule for sparse polynomial systems.





Describes a project that uses

Uses Software





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)