Let P1,..., Pn and Q1,...,Qn be convex polytopes in Rn such that Pi is a proper subset of Qi . It is well-known that the mixed volume has the monotonicity property: V (P1,...,Pn) is less than or equal to V (Q1,...,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,..., Pn whose number of isolated solutions equals the normalized volume of the convex hull of P1 U...U Pn . In addition, we obtain an analog of Cramer\u27s rule for sparse polynomial systems
Sparse elimination exploits the structure of a multivariate polynomial by considering its Newton pol...
AbstractThe study of monophonic convexity is based on the family of induced paths of a graph. The cl...
summary:In this note a class of convex polyhedral sets of functions is studied. A set of the conside...
Let P1,..., Pn and Q1,...,Qn be convex polytopes in Rn such that Pi is a proper subset of Qi . It is...
The paper gives various (positive and negative) results on the complexity of the problem of computin...
This paper is the second part of a broader survey of computational convexity, an area of mathematics...
This paper deals with linear systems containing finitely many weak and/or strict inequalities, whose...
In this paper we consider the following analog of Bezout inequality for mixed volumes: V(P1,…,Pr,Δn−...
AbstractSparse elimination exploits the structure of a multivariate polynomial by considering its Ne...
small corrections in version 2.Given convex polytopes $P_1 , . . . , P_r$ in $R^n$ and finite subset...
We consider the following Bezout inequality for mixed volumes: V (K1, . . . ,Kr, Δ[n − r])Vn(Δ)r−1 ≤...
Certifying function nonnegativity is a ubiquitous problem in computational mathematics, with especia...
In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensio...
We propose a parallel algorithm for computing the mixed volume of n convex polytopes in n-dimensiona...
This paper deals with systems of an arbitrary (possibly infinite) number of both weak and strict lin...
Sparse elimination exploits the structure of a multivariate polynomial by considering its Newton pol...
AbstractThe study of monophonic convexity is based on the family of induced paths of a graph. The cl...
summary:In this note a class of convex polyhedral sets of functions is studied. A set of the conside...
Let P1,..., Pn and Q1,...,Qn be convex polytopes in Rn such that Pi is a proper subset of Qi . It is...
The paper gives various (positive and negative) results on the complexity of the problem of computin...
This paper is the second part of a broader survey of computational convexity, an area of mathematics...
This paper deals with linear systems containing finitely many weak and/or strict inequalities, whose...
In this paper we consider the following analog of Bezout inequality for mixed volumes: V(P1,…,Pr,Δn−...
AbstractSparse elimination exploits the structure of a multivariate polynomial by considering its Ne...
small corrections in version 2.Given convex polytopes $P_1 , . . . , P_r$ in $R^n$ and finite subset...
We consider the following Bezout inequality for mixed volumes: V (K1, . . . ,Kr, Δ[n − r])Vn(Δ)r−1 ≤...
Certifying function nonnegativity is a ubiquitous problem in computational mathematics, with especia...
In polyhedral combinatorics one often has to analyze the facial structure of less than full dimensio...
We propose a parallel algorithm for computing the mixed volume of n convex polytopes in n-dimensiona...
This paper deals with systems of an arbitrary (possibly infinite) number of both weak and strict lin...
Sparse elimination exploits the structure of a multivariate polynomial by considering its Newton pol...
AbstractThe study of monophonic convexity is based on the family of induced paths of a graph. The cl...
summary:In this note a class of convex polyhedral sets of functions is studied. A set of the conside...