7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of the fewnomial bound for positive solutions to obtain a new bound for the number of non-zero real solutions to a system of n polynomials in n variables having n+k+1 monomials whose exponent vectors generate a subgroup of Z^n of odd index. This bound only exceeds the bound for positive solutions by the constant factor (e^4+3)/(e^2+3) and it is asymptotically sharp for k fixed and n large
Understanding, finding, or even deciding on the existence of real solutions to a system of equations...
International audienceWe study some systems of polynomials whose support lies in the convex hull of ...
Abstract. In the late 70’s A. Kouchnirenko posed the problem of bounding from above the number of po...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
We show that there are fewer than e 2)nk positive solutions to a fewno-mial system consisting of n p...
International audienceWe show the existence of systems of n polynomial equations in n variables, wit...
International audienceWe show that there are fewer than (e^2+3) 2^(k choose 2) n^k/4 non-degenerate ...
International audienceWe show the existence of systems of n polynomial equations in n variables, wit...
We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sh...
We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sh...
International audienceWe study some systems of polynomials whose support lies in the convex hull of ...
AbstractWe present a complete and practical algorithm which can determine the number of distinct rea...
We consider systems of polynomial equations and inequalities to be solved in integers. By applying t...
mixed volume of P1,..., Pn giving the number of complex solutions of a general com-plex polynomial s...
International audienceWe study polynomial systems whose equations have as common support a set C of ...
Understanding, finding, or even deciding on the existence of real solutions to a system of equations...
International audienceWe study some systems of polynomials whose support lies in the convex hull of ...
Abstract. In the late 70’s A. Kouchnirenko posed the problem of bounding from above the number of po...
7 pagesInternational audienceWe use Gale duality for complete intersections and adapt the proof of t...
We show that there are fewer than e 2)nk positive solutions to a fewno-mial system consisting of n p...
International audienceWe show the existence of systems of n polynomial equations in n variables, wit...
International audienceWe show that there are fewer than (e^2+3) 2^(k choose 2) n^k/4 non-degenerate ...
International audienceWe show the existence of systems of n polynomial equations in n variables, wit...
We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sh...
We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sh...
International audienceWe study some systems of polynomials whose support lies in the convex hull of ...
AbstractWe present a complete and practical algorithm which can determine the number of distinct rea...
We consider systems of polynomial equations and inequalities to be solved in integers. By applying t...
mixed volume of P1,..., Pn giving the number of complex solutions of a general com-plex polynomial s...
International audienceWe study polynomial systems whose equations have as common support a set C of ...
Understanding, finding, or even deciding on the existence of real solutions to a system of equations...
International audienceWe study some systems of polynomials whose support lies in the convex hull of ...
Abstract. In the late 70’s A. Kouchnirenko posed the problem of bounding from above the number of po...