Î T Beno

FR ÉD ÉRIC BIHAN Frank Bertrand

Sottile
email: sottile@math.tamu.edu

POLYNOMIAL SYSTEMS WITH FEW REAL ZEROES

We study some systems of polynomials whose support lies in the convex hull of a circuit, giving a sharp upper bound for their numbers of real solutions. This upper bound is non-trivial in that it is smaller than either the Kouchnirenko or the Khovanskii bounds for these systems. When the support is exactly a circuit whose affine span is Z n , this bound is 2n + 1, while the Khovanskii bound is exponential in n 2 . The bound 2n + 1 can be attained only for non-degenerate circuits. Our methods involve a mixture of combinatorics, geometry, and arithmetic.

Introduction

The notion of degree for a multivariate Laurent polynomial f is captured by its support, which is the set of exponent vectors of monomials in f . For example, Kouchnirenko [START_REF] Anatoli | A Newton polyhedron and the number of solutions of a system of k equations in k unknowns[END_REF] generalized the classical Bézout Theorem, showing that the number of solutions in the complex torus (C * ) n to a generic system of n polynomials in n variables with common support A is the volume v(A) of the convex hull of A, normalized so that the unit cube [0, 1] n has volume n!. This Kouchnirenko number is also a (trivial) bound on the number of real solutions to such a system of real polynomials. This bound is reached, for example, when the common support A admits a regular unimodular triangulation [START_REF] Sturmfels | On the number of real roots of a sparse polynomial system, Hamiltonian and gradient flows, algorithms and control[END_REF].

Khovanskii [5] gave a bound on the number of real solutions to a polynomial system that depends only upon the cardinality |A| of its support A:

Number of real solutions ≤ 2 n 2 ( |A|-1 2 ) • (n + 1) |A|-1 .
This enormous fewnomial bound is non-trivial (smaller than the Kouchnirenko bound) only when the cardinality of A is very small when compared to the volume of its convex hull. It is widely believed that significantly smaller bounds should hold. For example, Li, Rojas, and Wang [START_REF] Li | Counting real connected components of trinomial curve intersections and m-nomial hypersurfaces[END_REF] showed that two trinomials in 2 variables have at most 20 common solutions, which is much less than the Khovanskii bound of 20736. While significantly lower bounds are expected, we know of no reasonable conjectures about the nature of hypothetical lower bounds. There are few other examples of non-trivial polynomial systems for which it is known that not all solutions can be real via a bound smaller than the Khovanskii bound. We describe a class of supports and prove an upper bound (which is often sharp) for the number of real solutions to a polynomial system with those supports that is non-trivial in that it is smaller than either the Kouchnirenko or the Khovanskii bound.

A finite subset A of Z n that affinely spans Z n is primitive. A (possibly degenerate) circuit is a collection C := {0, w 0 , w 1 , . . . , w n } ⊂ Z n of n+2 integer vectors which spans R n . Here is the simplest version of our main results, which are proven in Sections 4 and 5. Theorem. A polynomial system with support a primitive circuit has at most 2n + 1 real solutions. There exist systems with support a primitive circuit having 2n + 1 nondegenerate real solutions.

This sharp bound for circuits suggests that one may optimistically expect similar dramatic improvements in the doubly exponential Khovanski bound for other sets A of supports.

Adding the vectors 2w 0 , 3w 0 , . . . , kw 0 to a circuit C produces a near circuit if Rw 0 ∩ C = {0, w 0 }. Let ν be the cardinality of D ∩ {w 1 , . . . , w n }, where D ⊂ C is a minimal affinely dependent subset. Let ℓ be the largest integer so that w 0 /ℓ is integral. We show that a polynomial system with support a primitive near circuit has at most k(2ν-1) + 2 real solutions if ℓ is odd, or at most 2kν + 1 real solutions if ℓ is even, and these bounds are tight among all such near circuits. These bounds coincide when k = 1, that is, for primitive circuits. This is proven in Theorem 5. [START_REF] Anatoli | A Newton polyhedron and the number of solutions of a system of k equations in k unknowns[END_REF].

For a given near circuit, we use its geometry and arithmetic to give tighter upper bounds and construct systems with many real zeroes.

An important step is to determine an eliminant for the system, which has the form ( * )

x N p i=1 (g i (x ℓ )) λ i - ν i=p+1 (g i (x ℓ )) λ i ,
where the polynomials g i all have degree k, and N and λ i are the coefficients of the minimal linear dependence relation among D ∪ {w 0 /ℓ}. This reduces the problem to studying the possible numbers of real zeroes of such a univariate polynomial. We adapt a method of Khovanskii to establish an upper bound for the number of real zeroes of such a polynomial. Our upper bound uses a variant of the Viro construction, which also allows us to construct polynomials ( * ) with many real zeroes.

In Section 1, we establish some basics on sparse polynomial systems, and then devote Section 2 to an example of a family of near circuits for which it is easy to establish sharp upper bounds, as simple linear algebra suffices for the elimination, Descartes's rule of signs gives the bounds, and the Viro construction establishes their sharpness. In Section 3, we compute an eliminant of the form ( * ) for a system supported on a near circuit. Section 4 is devoted to proving an upper bound for the number of real solutions to a polynomial of the form ( * ), while in Section 5 we construct such polynomials with many real zeroes, and describe some cases in which our bounds are sharp, including when A is a circuit.

The authors wish to thank Stepan Orevkov and Andrei Gabrielov for useful discussions.

Basics on sparse polynomial systems

We emphasize that we look for solutions to polynomial systems which have only non-zero coordinates and thus lie in (C * ) n . Write x w for the monomial with exponent vector w ∈ Z n .

Let A ⊂ Z n be a finite set which does not lie in an affine hyperplane. A polynomial f has support A if the exponent vectors of its monomials lie in A. A polynomial system with support A is a system (1.1)

f 1 (x 1 , . . . , x n ) = f 2 (x 1 , . . . , x n ) = • • • = f n (x 1 , . . . , x n ) = 0 ,
where each polynomial f i has support A. Multiplying a polynomial f by a monomial x w does not change its set of zeroes in (C * ) n , but does translate its support by the vector w. Thus it is no loss to assume that 0 ∈ A. A system (1.1) is generic if its number of solutions in (C * ) n equals v(A), the volume of the convex hull of A normalized so that the unit cube [0, 1] n has volume n!, which is the Kouchnirenko bound [START_REF] Anatoli | A Newton polyhedron and the number of solutions of a system of k equations in k unknowns[END_REF]. This condition forces each solution to be simple. We will always assume that our systems are generic in this sense.

Let ZA ⊂ Z n be the full rank sublattice generated by the vectors in A. (This is the affine span of A as 0 ∈ A.)

If ZA = Z n , then A is primitive. The index of A is the index of ZA in Z n .
The fundamental theorem of abelian groups implies that

Z n ZA ≃ Z a 1 Z ⊕ Z a 2 Z ⊕ • • • ⊕ Z a n Z ,
where a i divides a i+1 , for i = 1, . . . , n-1. These numbers a 1 , . . . , a n are the invariant factors of A. When A is a simplex-so there are n non-zero vectors in A-then the numbers a i are the invariant factors of the matrix whose columns are these vectors. The index of A is the product of its invariant factors.

1.1. Polynomial systems with support a simplex. Let e(A) be the number of even invariant factors of A. The following result can be found in Section 3 of [START_REF] Sturmfels | On the number of real roots of a sparse polynomial system, Hamiltonian and gradient flows, algorithms and control[END_REF].

Proposition 1.1. Suppose that A is the set of vertices of a simplex. Then the number of real solutions to a generic system with support A is

(i) 0 or 2 e(A) if v(A) is even. (ii) 1 if v(A) is odd.
Proof. Suppose that 0 ∈ A. Given a polynomial system (1.1) with support A whose coefficients are generic, we may perform Gaussian elimination on the matrix of its coefficients and convert it into a system of the form (1.2)

x w i = β i , for i = 1, . . . , n ,
where β i = 0 and w 1 , . . . , w n are the non-zero elements of A. Solutions to this system have the form ϕ -1 A (β), where

β = (β 1 , . . . , β n ) ∈ (C * ) n and ϕ A is the homomorphism (C * ) n ∋ (x 1 , . . . , x n ) -→ (x w 1 , . . . , x wn ) ∈ (C * ) n .
Real solutions to (1.2) are ψ -1 (β), where β ∈ (R * ) n and ψ : (R * ) n → (R * ) n is the restriction of ϕ A to (R * ) n . The kernel of ψ consists of those points x ∈ {±1} n that satisfy

x w i = 1 for i = 1, . . . , n .
Let A be a matrix whose columns are the non-zero elements of A. Identifying {±1} with Z/2Z identifies the kernel of ψ with the kernel of the reduction of A modulo 2, which has dimension e(A). The result follows as ψ is surjective if (and only if) e(A) = 0, which is equivalent to v(A) being odd.

Remark 1.2. The upper bound of Proposition 1.1 for a system with support A is the volume of A if and only if no invariant factor of A exceeds 2.

1.2. Generic systems. The system (1.2) is generic (has v(A) simple roots in (C * ) n ) when the numbers β i are non-zero. We give a proof of the following elementary result, as we will use the proof later. Proposition 1.3. Suppose that A does not lie in an affine hyperplane. Then there is a non-empty Zariski open subset in the space of coefficients of monomials appearing in a system with support A such that the system has v(A) simple solutions in (C * ) n .

Proof. Suppose that 0 ∈ A. Then the affine span ZA is a full rank sublattice of Z n . Let a := |A| -1 and consider the map ϕ A defined by

(1.3) ϕ A : (C * ) n ∋ (x 1 , . . . , x n ) -→ [x w | w ∈ A] ∈ P a .
Its image is a subgroup of the dense torus in P a , and it is a homomorphism of algebraic groups. Then a polynomial system (1.1) with support A is the pullback of n linear forms (given by the coefficients of the f i ) along the map ϕ A . These n linear forms determine a linear section of the closure X A of the image of ϕ A , a (not necessarily normal) projective toric variety [9, §4,13]. Bertini's Theorem [4, p. 179] asserts that a general linear section of X A consists of deg(X A ) simple points, all lying in the image of ϕ A . Each of these pull back along ϕ A to |ker(ϕ A )| distinct solutions to the original system. The kernel of ϕ A is the abelian group dual to the factor group Z n /ZA, which has order equal to the index of A. Furthermore, the toric variety X A has degree equal to the volume of the convex hull of A, normalized so that a unit parallelepiped of ZA has volume n!. The product of this volume with the index of A is the usual volume of A. Thus a system with support A and generic coefficients has v(A) simple solutions.

1.3. Congruences on the number of real solutions. The proof of Proposition 1.3 shows that the solutions to the system (1.1) are the fibres ϕ -1 A (β) for the points β in a linear section of X A . It follows that Proposition 1.1 gives some restrictions on the possible numbers of real solutions. The index of A factors as 2 e(A) • N .

Corollary 1.4. The number of real solutions to (1.1) is at most v(A)/N and is congruent to this number modulo max{2, 2 e(A) }.

Proof. Let ϕ A be the map (1.3). The image of any real solution to (1.1) under ϕ A is a real point, and there are 2 e(A) real solutions with the same image under ϕ A . Thus the maximum number of real solutions to (1.1) is 2 e(A) • deg X A , which is v(A)/N . The congruence follows as the restriction of the map ϕ A to the real subtorus is surjective on the real subtorus of X A if and only if e(A) = 0. Remark 1.5. Any bound or construction for the number of real roots of polynomial systems associated to primitive vector configurations gives the same bounds and constructions for the number of real roots for configurations with odd index. Indeed, let A ⊂ Z n be finite and B ⊂ Z n be a basis for ZA so that linear combinations of vectors in B identify ZA with Z n . This identification maps A to a primitive vector configuration A ′ , which has the same geometry and arithmetic as A. The map ϕ A (1.3) factors

(C * ) n ϕ B∪{0} ----→ (C * ) n ϕ A ′ --→ P a .
Since A and B ∪ {0} have the same (odd) index, ϕ B∪{0} is bijective on (R * ) n . Thus ϕ B∪{0} gives a bijection between real solutions to systems with support the primitive vector configuration A ′ and real solutions to systems with support A.

A family of systems with a sharp bound

We describe a family of supports ∆ ⊂ Z n and prove a non-trivial sharp upper bound on the number of real solutions to polynomial systems with support ∆. That is, the points in ∆ affinely span Z n , but there are fewer than v(∆) real solutions to polynomial systems with support ∆. These sets ∆ also have the property that they consist of all the integer points in their convex hull.

Let l > k > 0 and n ≥ 3 be integers and ǫ = (ǫ 1 , . . . , ǫ n-1 ) ∈ {0, 1} n-1 be non-zero. Then ∆ ǫ k,l ⊂ R n consists of the points (0, . . . , 0), (1, 0, . . . , 0), . . . , (0, . . . , 0, 1, 0), (0, . . . , 0, k), (ǫ 1 , . . . , ǫ n-1 , l) .

together with the points along the last axis (0, . . . , 0, 1), (0, . . . , 0, 2), . . . , (0, . . . , 0, k-1) .

Since these include the standard basis and the origin, ∆ ǫ k,l is primitive. Set |ǫ| := i ǫ i . Then the volume of ∆ ǫ k,l is l + k|ǫ|. Indeed, the configuration ∆ ǫ k,l can be triangulated into two simplices ∆ ǫ k,l \ {(ǫ 1 , . . . , ǫ n-1 , l)} and ∆ ǫ k,l \ {0} with volumes k and l -k + k|ǫ|, respectively. One way to see this is to apply the affine transformation

(x 1 , . . . , x n ) -→ (x 1 , . . . , x n-1 , x n -k + k n-1 i=1 x i ) .
Theorem 2.1. The number, r, of real solutions to a generic system of n real polynomials with support ∆ ǫ k,l lies in the interval

0 ≤ r ≤ k + k|ǫ| + 2 ,
and every number in this interval with the same parity as l + k|ǫ| occurs.

This upper bound does not depend on l and, since k < l, it is smaller than or equal to the number l + k|ǫ| of complex solutions. We use elimination to prove this result.

Example 2.2. Suppose that n = k = 3, l = 5, and ǫ = (1, 1).

Then the system

1 x y z z 2 z 3 xyz 5 x + y + xyz 5 + 1 + z + z 2 + z 3 = 0 x + 2y + 3xyz 5 + 5 + 7z + 11z 2 + 13z 3 = 0 2x + 2y + xyz 5 + 4 + 8z + 16z 2 + 32z 3 = 0 is equivalent to x -(5 + 11z + 23z 2 + 41z 3 ) = 0 y + (8 + 18z + 38z 2 + 72z 3 ) = 0 xyz 5 -(2 + 6z + 14z 2 + 30z 3 ) = 0
And thus its number of real roots equals the number of real roots of

z 5 (5 + 11z + 23z 2 + 41z 3 )(8 + 18z + 38z 2 + 72z 3 ) -(2 + 6z + 14z 2 + 30z 3 ) ,
which, as we invite the reader to check, is 3.

Proof. A generic real polynomial system with support ∆ ǫ k,l has the form

n-1 j=1 c ij x j + c in x ǫ x l n + f i (x n ) = 0 for i = 1, . . . , n ,
where each polynomial f i has degree k and x ǫ is the monomial

x ǫ 1 1 • • • x ǫ n-1
n-1 . Since all solutions to our system are simple, we may perturb the coefficient matrix (c ij ) n i,j=1 if necessary and then use Gaussian elimination to obtain an equivalent system (2.1)

x 1 -g 1 (x n ) = • • • = x n-1 -g n-1 (x n ) = x ǫ x n l -g n (x n ) = 0 ,
where each polynomial g i has degree k. Using the first n -1 polynomials to eliminate the variables x 1 , . . . , x n-1 gives the univariate polynomial

(2.2) x n l • g 1 (x n ) ǫ 1 • • • g n-1 (x n ) ǫ n-1 -g n (x n ) , which has degree l + k|ǫ| = v(∆ ǫ k,l
). Any zero of this polynomial leads to a solution of the original system (2.1) by back substitution. This implies that the number of real roots of the polynomial (2.2) is equal to the number of real solutions to our original system (2.1).

The eliminant (2.2) has no terms of degree m for k < m < l, and so it has at most k + k|ǫ| + 2 non-zero real roots, by Descartes's rule of signs ( [START_REF] Descartes | A source book in Mathematics[END_REF][START_REF] Basu | Algorithms in real algebraic geometry[END_REF], see also Remark 2.3). This proves the upper bound. We complete the proof by constructing a polynomial of the form (2.2) having r roots, for every number r in the interval between 0 and k + k|ǫ| + 2 with the same parity as l + k|ǫ|.

Choose real polynomials f 1 , . . . , f n of degree k having simple roots and non-zero constant terms. We further assume that the roots of f 1 , . . . , f n-1 are distinct. Put

f ǫ = f ǫ 1 1 • • • f ǫ n-1
n-1 and let α be the ratio of the leading term of f n to the constant term of f ǫ . Choose any piecewise-linear convex function ν : [0, k|ǫ| + l] → R which is identically 0 on [l, k|ǫ| + l] and whose maximal domains of linearity are [0, k], [k, l], and [l, k|ǫ| + l].

Let f (z) := f n ± αz l f ǫ (the sign ± will be determined later). The Viro polynomial f t associated to f and ν is obtained by multiplying the monomial a p z p in f (z) by t ν(p) ( [START_REF] Viro | Gluing of algebraic hypersurfaces, smoothing of singularities and construction of curves[END_REF][START_REF]Gluing of plane algebraic curves and construction of curves of degree 6 and 7[END_REF][START_REF] Bihan | Viro method for the construction of real complete intersections[END_REF]). By the definition of ν,

f t = f n,t +αz l f ǫ 1 1 • • • f ǫ n-1
n-1 , where f n,t is the Viro polynomial obtained from f n and the restriction of ν to [0, k]. By Viro's Theorem ([10, 11, 2], see also Proposition 4.1), there exists a sufficiently small t 0 > 0, such that if t 0 > t > 0, then the polynomial f t will have r = r 1 + r 2 + r 3 simple real roots, where r 1 is the number of real roots of f ǫ , r 2 the number of real roots of f n , and r 3 is the number of (non-zero) real roots of the binomial obtained as the truncation of f to the interval [k, l]. By our choice of α, this binomial is a constant multiple of z k ± z l . Thus r 3 is 1 if l -k is odd, and either 0 or 2 (depending on the sign ±) if l -k is even. If k is even, then every possible value of r between 0 and k + k|ǫ| + 2 with the same parity as l + k|ǫ| can be obtained in this way. If k is odd then this construction gives all admissible values of r in the interval

[|ǫ| + 2, k + k|ǫ| + 2] but no values of r less than |ǫ| + 2.
Suppose now that k is odd. Take one of the Viro polynomials f t with r ′ ≥ |ǫ| + 2 real roots. For a generic t, the crital values of f t are all different. Choose one such t and suppose without loss of generality that the leading coefficient of f t is positive. For each λ, consider the polynomial h λ = -λ -f t . If λ is larger than every critical value of f t , then h λ has either 0 or 1 real roots, depending upon the parity of k|ǫ| + l. Since the number of real roots of h λ changes by 2 when λ passes through critical values of f t , and h 0 has at least |ǫ| + 2 real roots, every possible number of real roots between 0 and |ǫ| + 2 having the same parity as l + k|ǫ| occurs for some h λ .

Remark 2.3. [Descartes's bound] Let f (x) = d i=1 a i x p i be a univariate polynomial with exponents p 1 < • • • < p d
and a 1 , . . . , a d are non-zero real numbers. Descartes's rule of signs asserts that the number of positive roots of f is no more than the number of i ∈ {1, . . . , d -1} with a i • a i+1 < 0. Applying this to f (x) and f (-x) shows that the number of non-zero real roots of f is no more than d-1 i=1 (p i+1 -p i ), where a = 1 or 2 according as a is odd or even, respectively.

Elimination for near circuits

We first consider (possibly degenerate) circuits, which are collections of n+2 integer vectors that affinely span R n .

3.1. Arithmetic of circuits. Suppose that C := {w -1 , w 0 , w 1 , . . . , w n } ⊂ Z n affinely spans R n . For each i = -1, 0, . . . , n, let A i be the (possibly degenerate) simplex with vertices C \ {w i }. For any j ∈ {-1, 0, . . . , n}, Cramer's rule implies that

j-1 i=-1 (-1) i det(W i )(w i -w j ) = n i=j+1 (-1) i det(W i )(w i -w j ) ,
where W i is the matrix whose columns are the vectors w -1 -w j , . . . , w n -w j , with w i -w j and w j -w j omitted.

Thus if i = j, | det W i | is the volume v(A i ) of A i . Lemma 3.1. Suppose that {0, v 0 , . . . , v n } ⊂ Z n is primitive with primitive relation n i=0 α i v i = 0 . If A q := {0, v 0 , . . . , v q , . . . , v n }, then Z n /ZA q ≃ Z/α q Z.
Proof. We can assume that q = 0. Since {0, v 0 , . . . , v n } is primitive,

Z n = Z{v 0 , v 1 , . . . , v n }.
Then the image of v 0 generates the factor group Z n /Z{v 1 , . . . , v n }, and so this factor group is cyclic. Since the relation is primitive, |α 0 | is the least positive multiple of v 0 lying in the lattice Z{v 1 , . . . , v n }, which implies that Z n /Z{v 1 , . . . , v n } ≃ Z/α 0 Z.

When C = {w -1 , w 0 , w 1 , . . . , w n } is primitive, this proof shows that the invariant factors of A q are 1, . . . , 1, |α q |, and v(A q ) = |α q |. In general, the index a of C is the greatest common divisor of the volumes v(A i ), and the primitive affine relation on C has the form n i=-1

α i w i = 0 with n i=-1 α i = 0 ,
where

a|α i | = v(A i ).
Note that the configuration C admits two triangulations. One is given by those A i with α i > 0 and the other by those A i with α i < 0.

From now on, we make the following assumptions. First, assume w -1 = 0 and choose signs so that α 0 ≥ 0. Furthermore, assume the vectors w 1 , . . . , w n are ordered so that α 1 , . . . , α p > 0, α p+1 , . . . , α ν < 0, and α ν+1 , . . . , α n = 0, for some integers 0 ≤ p ≤ ν ≤ n. If a is the index of C and we write

λ i = |α i | = v(A i )/a, then the primitive relation on C is p i=0 λ i w i = ν i=p+1 λ i w i ,
and we have

(3.1) v(C) = a • max p i=0 λ i , ν i=p+1 λ i ,
as at least one of {A 0 , . . . , A p } or {A p+1 , . . . , A ν } is a triangulation of C. If A -1 is nondegenerate, then adding it to the non-triangulation produces a triangulation. Thus v(A -1 ) is the difference of the two numbers in (3.1).

3.2.

Systems with support a near circuit. Let {0, w 0 , w 1 , . . . , w n } ⊂ Z n span R n and suppose that w 0 = ℓe n , where e n is the nth standard basis vector and ℓ is a positive integer. Let k > 0 and consider a generic polynomial system with support (3.2) C := {0, w 0 , 2w 0 , . . . , kw 0 , w 1 , . . . , w n } .

We will call such a set of vectors a near circuit if no w i for i > 0 lies in Rw 0 . We will assume that C is primitive, which implies that {0, e n , w 1 , . . . , w n } is primitive. By Remark 1.5, this will enable us to deduce results for near circuits having odd index.

Write each vector w

i = v i + l i • e n , where 0 = v i ∈ Z n-1 . Then {0, v 1 , . . . , v n } is primitive. Let λ 1 , . . . , λ ν be the positive integral coefficients in the primitive relation on {0, v 1 , . . . , v n }, p i=1 λ i v i = ν i=p+1 λ i v i .
Here, we could have p = 0 or p = ν, so that one of the two sums collapses to 0.

Assume that the vectors are ordered so that

(3.3) N e n + p i=1 λ i w i - ν i=p+1 λ i w i = 0
is the primitive relation on {0, e n , w 1 , . . . , w n }, where

N := ν i=p+1 λ i l i - p i=1 λ i l i ≥ 0 .
Consider a generic real polynomial system with support the near circuit C. Perturbing the matrix of coefficients of the monomials x w i for i = 1, . . . , n and applying Gaussian elimination gives a system with the same number of real solutions, but of the form (3.4)

x w i = g i (x ℓ n ) for i = 1, . . . , n ,
where each g i is a generic polynomial of degree k.

Define a polynomial f ∈ R[x n ] by (3.5) f (x n ) := x N n p i=1 (g i (x ℓ n )) λ i - ν i=p+1 (g i (x ℓ n )) λ i .
Here, empty products are equal to 1. By (3.1), the degree of f is equal to the volume of the near circuit C, as N is the volume of A 0 and kℓλ i is the volume of the simplex A i , which is the convex hull of {kw 0 = kℓe n , 0, w 1 , . . . , w i , . . . , w n }. Lastly, the absolute value of the difference

(3.6) δ := N + p i=1 kℓλ i - ν i=p+1 kℓλ i
in the degrees of the two terms of f is the volume of the convex hull of {kℓe n , w 1 , . . . , w n }, which may be zero.

Theorem 3.2. Assume that g 1 , . . . , g n are generic polynomials of degree k. Then, the association of a solution x of (3.4) to its nth coordinate x n gives a one-to-one correspondence between solutions of (3.4) and roots of the univariate polynomial f (3.5) which restricts to a bijection between real solutions to (3.4) and real roots of f .

In particular, bounds on the number of real roots of polynomials of the form (3.5) give bounds on the number of real solutions to a generic polynomial system with support C. The polynomial f is the eliminant of the system (3.4), but our proof is not as direct as the corresponding proof in Section 2. Lemma 3.3. For each q = 1, . . . , ν, the system

I q : x w i = g i (x ℓ n ), for i = 1, . . . , n, i = q f (x n ) = 0
is equivalent to the system J q :

x w i = g i (x ℓ n ), for i = 1, . . . , n, i = q x wq λq = g q (x ℓ n )

λq Proof. This follows from (3.3) and the form (3.5) of f . Remark 3.4. Observe that the last polynomial in the system J q factors

(x wq ) λq -(g q (x ℓ n )) λq = ζ∈Z λq ζx wq -g q (x ℓ n ) ,
where Z λq is the set of roots of z λq -1. For a solution x to J q , the number ζ is x -wq g q (x ℓ n ). This factorization reveals that the system J q is a disjunction of λ q systems with support C. The subsystem with ζ = 1 is our original system (3.4).

Proof of Theorem 3.2. Since the integers λ 1 , . . . , λ ν are coprime, at least one λ i is odd. We restrict ourselves to the case where λ 1 is odd since the proof with any other λ i odd is similar. Let q = 1 in Lemma 3.3 and let x n be a root of f . We show that x n extends to a unique solution of (3.4), and that the solution is real if and only if x n is real.

We first prolong x n to solutions to the system I 1 by solving the system for y ∈ (C * ) n-1

(3.7)

y v i = x -l i n g i (x ℓ n ) for i = 2, . . . , n .
The numbers β i := x -l i n g i (x ℓ n ) are well-defined and non-zero since the g i are generic polynomials of degree k. Hence (3.7) is a system associated to the simplex B = {0, v 2 , . . . , v n } ⊂ Z n-1 as studied in Proposition 1.1. Its set of solutions is ϕ -1 B (β), where ϕ B : (C * ) n-1 → (C * ) n-1 is the homomorphism

ϕ B : t -→ (t v 2 , . . . , t vn ) ∈ (C * ) n-1 . Let y ∈ ϕ -1 B (β). Then the fibre ϕ -1 B (β) is the set {ty | t ∈ ker(ϕ B )}.
We determine which of these, if any, is a solution to (3.4) by computing the number ζ of Remark 3.4.

For ty ∈ ϕ -1 B (β), this number is t -v 1 y -v 1 x -l 1 n g 1 (x ℓ n ). Consider the map ψ : ker(ϕ B ) ∋ t -→ t v 1 ∈ Z λ 1 . Since D = {0, v 1 , . . . , v n } ⊂ Z n-1 is primitive, ψ is well-defined by Lemma 3.1. Similarly, ϕ D is injective (see Proposition 1.
3), and thus so is ψ. Note that ker(ϕ B ) is isomorphic to Z λ 1 , thus ψ is an isomorphism. Thus exactly one of these prolongations of x n given by ϕ -1 B (β) is a solution to (3.4). Suppose now that x n is real. Then β is real. Since λ 1 is odd, there is a unique real solution y to (3.7), by Proposition 1.1. But then y -v 1 x -l 1 n g 1 (x ℓ n ) is real. As λ 1 is odd, there is eactly one real λ 1 -th root of unity, namely 1, which proves that the real solution (y, x n ) is a real solution to (3.4). This completes the proof of the theorem.

Remark 3.5. The primitivity of C implies that N and ℓ are coprime if N = 0, or ℓ = 1 if N = 0. Indeed, the affine span of C is equal to that of {ℓe n , w 1 , . . . , w n } and the Cramer relation on this set is obtained by multiplying both sides of (3.3) by ℓ. Hence, the index of C is the greatest common divisor of N, ℓλ 1 , . . . , ℓλ ν , and the result follows as the λ i are coprime. In particular, either ℓ is odd, or ℓ is even and N and δ are odd.

Example 3.6. We show that any positive integers p, ℓ, N , with N, ℓ coprime if N = 0 or ℓ = 1 if N = 0, and any positive coprime integers λ 1 , . . . , λ ν with ν ≤ n correspond to a primitive near circuit, when one λ i = 1. Thus any polynomial of the form (3.5) is the eliminant of a system with support a primitive near circuit, when one exponent λ i = 1.

Assume without loss of generality that λ ν = 1. Let e 1 , . . . , e n be the standard basis in R n . Let v i := e i for i = 1, . . . , ν -1. Set

v ν := p i=1 λ i v i - ν-1 i=p+1 λ i v i .
Since λ 1 , . . . , λ ν are coprime, there exist integers l 1 , . . . , l ν such that N = ν i=p+1 λ i l ip i=1 λ i l i . If we set w i := v i + l i e n for i = 1, . . . , ν and w i := e i-1 for i = ν + 1, . . . , n, then we obtain the relation (3.3) among e n , w 1 , . . . , w n . It is then easy to see that the near circuit {0, ℓe n , . . . , kℓe n , w 1 , . . . , w n } is primitive (for any integer k) if we assume that N and ℓ are coprime, or ℓ = 1 if N = 0.

Upper bounds for near circuits

We first give a version of Viro's construction for univariate polynomials that takes multiplicities into account. We then use this to establish upper bounds for the number of real roots of polynomials of the form (3.5) by studying the total variation in the number of real roots of a pertubation of the eliminant.

Viro univariate polynomials. Consider a univariate Viro polynomial

f t (y) = d p=p 0 φ p (t) y p ,
where t is a positive real number, and each coefficient φ p (t) is a finite sum q∈Ip c p,q t q with c p,q ∈ R and q a rational number. Write f for the function of y and t defined by f t .

Let P be the convex hull of the points (p, q) for p 0 ≤ p ≤ d and q ∈ I p . Assume that P has dimension 2. Its lower hull L is the union of the edges L 1 , . . . , L l of P whose inner normals have positive second coordinate. Let I i be the image of L i under the projection to the first axis. Then the intervals I 1 , . . . , I l subdivide the Newton segment [p 0 , d] of f t .

Let f (i) be the facial subpolynomial of f for the face L i . That is, f (i) is the sum of terms c p,q y p such that (p, q) ∈ L i . Suppose that L i is the graph of y → a i y + b i over I i , Expanding f t (yt -a i )/t b i in powers of t gives (4.1)

f t (yt -a i ) t b i = f (i) (y) + t A i d (i) (y) + h (i) (y, t) , i = 1, . . . , l,
where t A i d (i) (y) collects the terms with smallest positive power of t and h (i) (y, t) collects the remaining terms (whose powers of t exceed A i ). Then f (i) (y) has Newton segment I i and its number of non-zero roots counted with multiplicities is |I i |, the length of the interval I i .

Proposition 4.1. Assume that for any non-zero root ρ of f (i) , i = 1, . . . , l, either ρ is a simple root of f (i) , or else d (i) (ρ) = 0. Then there exists t 0 > 0 such for 0 < t < t 0 , the univariate polynomial f t (y) has only simple non-zero roots, with

r = c(ρ)
non-zero real roots, where the sum is over i = 1, . . . , l and then all non-zero real roots ρ of f (i) where

c(ρ) =    1 if the multiplicity m of ρ is odd, 0 if m is even and f (i) (y)/d (i) (ρ) > 0, for y near ρ, 2 if m is even and f (i) (y)/d (i) (ρ) < 0, for y near ρ.
In particular, if the non-zero roots of f (1) , . . . , f (l) are simple, then the number of nonzero real roots of f t for t > 0 small enough equals the total number of non-zero real roots of f (1) , . . . , f (l) . This is the usual version of Viro's theorem for univariate polynomials.

Proof. For each root ρ = 0 of f (i) (y) of multiplicity m, there will be m roots near ρ to

f (i) (y) + t A i d (i) (y) + h (i) (y, t) ,
for t > 0 sufficiently small. This gives |I i | roots to f t (yt -a i )/t b i , and thus all solutions to f t in C * , at least when t > 0 is sufficiently small. Indeed, let K ⊂ C * be a compact set containing the non-zero roots of the facial polynomials f (1) (y), . . . , f (l) (y). Then, for t > 0 sufficiently small, K contains the |I i | roots to f t (yt -a i )/t b i that we just constructed. The compact sets t -a 1 K, . . . , t -a l K are pairwise disjoint for t > 0 sufficiently small, and this gives

|I 1 | + • • • + |I l | = d -p 0 non
-zero simple roots of f t for t > 0 small enough. But this accounts for all the non-zero simple roots of f t .

We now determine how many roots of f t (yt -a i )/t b i are real. Roots close to ρ are real only if ρ is real, and then the number of such real roots is determined by the first two terms f (i) (y) + t A i d (i) (y) in t, as d (i) (ρ) = 0. But this polynomial has c(ρ) real roots near ρ.

Upper bounds.

We give upper bounds on the number of real roots of a generic polynomial system with support a primitive near circuit C = {0, ℓe n , 2ℓe n , . . . , kℓe n , w 1 , . . . , w n } .

As explained in Section 3, it suffices to bound the roots of a polynomial f of the form (3.5). Consider the polynomial f t (y) depending on a real parameter t = 0 defined by

f t (y) := t • y N p i=1 (g i (y ℓ )) λ i - ν i=p+1 (g i (y ℓ )) λ i ,
where g 1 , . . . , g ν are generic polynomials of degree k. We will study how the number of real roots of f t can vary as t runs from ∞ to 1. Note that f 1 is our original eliminant f . Remark 4.2. If p = 0 then f t (x n ) is the eliminant of the system

x w 1 = t 1/λ 1 • g 1 (x ℓ n ) , x w i = g i (x ℓ n ) i = 2, .
. . , n . If p = 0, then f t is t 2 times the eliminant of the system Let χ(Y ) be the boolean truth value of Y , so that χ(0 > 1) = 0, but χ(0 < 1) = 1.

x w 1 = t -1/λ 1 • g 1 (x ℓ n ) , x w i = g i (x ℓ n ) i = 2,
Proposition 4.3. The total sum of the multiplicities of the non-zero singular real roots of f t for t ∈ R * is no more than 2kℓν -2 l (χ(δ = 0) + χ(N = 0)). Moreover, if ℓ is even, so that N is odd due to the primitivity of C, then the total sum of the multiplicities of the non-zero singular real roots of f t for t > 0 is equal to the corresponding sum for t < 0. Hence, both numbers are no more 2kν.

Proof. Write f t = tF -where F and G are the two terms of f . Let ρ be a non-zero root of f t for some t = 0. Then F (ρ)G(ρ) = 0, as the roots of g 1 , . . . , g ν are distinct. Note that t = G(ρ)/F (ρ). Then ρ is a singular root of f t if and only if

(F ′ G -F G ′ )(ρ) = 0 . If N = 0, then the polynomial F ′ G -F G ′ factors as (4.2) (F ′ G -F G ′ )(y) = y N -1 ν i=1 (g i (y ℓ )) λ i -1 • H(y)
where H is the polynomial defined by

H(y) = ν i=1 g i (y ℓ ) • N + ℓy ℓ • D(y ℓ ) , with D(z) = p i=1 λ i • g ′ i (z) g i (z) - ν i=p+1 λ i • g ′ i (z) g i (z)
.

(If N = 0, then y N -1 is replaced by y ℓ-1 , and the last factor in H is simply ℓD(y ℓ ).) Thus H(y) = h(y ℓ ), where h is a polynomial of degree kν -(χ(δ = 0) + χ(N = 0)) with a non-zero constant term, as the g i are generic. If ρ is a non-zero singular real root of f t for t = 0 then h(ρ ℓ ) = 0. Thus the total number of non-zero singular real roots of f t for t ∈ R * is at most kℓν -l (χ(δ = 0) + χ(N = 0)).

A root ρ of f t has multiplicity m ≥ 2 for some t = 0 if and only if tF (i) (ρ) -G (i) (ρ) = 0 for i = 0, . . . , m -1 and tF (m) (ρ) -G (m) (ρ) = 0. This is equivalent to the system (4.3)

F (i) (ρ) • G (j) (ρ) -F (j) (ρ) • G (i) (ρ) = 0 if 0 ≤ i, j ≤ m -1, F (i) (ρ) • G (j) (ρ) -F (j) (ρ) • G (i) (ρ) = 0 if i = m and 0 ≤ j ≤ m -1.
Solving (4.2) for H and using the expression of the kth derivative of F ′ G -F G ′ as a sum of polynomials of the form F (i) G (j) -F (j) G (i) , we can use (4.3) to deduce that ρ is a root of multiplicity m ≥ 2 of f t for some t = 0 if and only if ρ is a root of multiplicity m-1 of H. Thus the total sum of the multiplicities of the non-zero singular real roots of

f t for t ∈ R * is (4.4) ρ a real root of H (m ρ (H) + 1) ,
where m ρ (H) is the multiplicity of the root ρ of H. We see that (4.4) is bounded by 2kℓν -2ℓ (χ(δ = 0) + χ(N = 0)) with equality when all roots of h are real and simple (and positive if ℓ is even) so that the singular real roots of f t for t ∈ R * are real double roots.

Finally, the statement concerning the case ℓ even and N odd is obvious after noting that in this case the (non-zero) real roots of h(y ℓ ) come in pairs (ρ, -ρ), the function G/F is an odd function, and N and δ are both odd integer numbers. Remark 4.4. If {kℓe n , w 1 , . . . , w n } are affinely independent and N = 0, then the difference δ (3.6) of the degrees of the terms of f is non-zero, and the polynomials f t have the same Newton segment for t = 0. Thus the number of real roots of f t can change only if t passes through 0, or through a value c = 0 such that f c has a singular root.

If the difference δ = 0, then there is one number t ∞ for which the degree of f t∞ drops. If necessary, we may perturb coefficients of one g i so that the number of real roots of f does not change, and the degree of f t∞ drops by one. This will result in no net change in the number of real roots of f t as t passes through t ∞ , for the root which 'disappears' in f t∞ is a real root at infinity. Similarly, if N = 0, then we may assume that there is one number t 0 for which the constant term of f t 0 vanishes. Perturbing again if necessary results in no net change in the number of non-zero real roots of f t as t passes through t 0 .

Thus, the number of values c where the number of real roots of f t changes is finite by Proposition 4.3, and hence it makes sense to define the numbers r -∞ , r 0-, r 0+ , r +∞ as the numbers of real roots of f t as t tends to -∞, 0 by negative values, 0 by positive values and +∞, respectively.

Recall that χ(Y ) denotes the boolean truth value of Y . Proposition 4.5. We have

r 0+ + r 0- 2 ≤ kℓ(ν -p) + χ(δ > 0) r +∞ + r -∞ 2 ≤ kℓp + χ(N > 0) + χ(δ < 0) |r 0+ -r 0-| 2 ≤ kℓ ν i=p+1 λ i -kℓ(ν -p) + χ(δ > 0 is even) |r +∞ -r -∞ | 2 ≤ kℓ p i=1 λ i -kℓp + χ(N > 0 is even) + χ(δ < 0 is even)
Furthermore, if l is even and N is odd, we have

r 0+ + r +∞ 2 ≤ kν + 1
Proof. As in the proof of Proposition 4.3, write f t = tF -G. We apply Proposition 4.1 (and its proof) to f t and f -t = -tF -G to estimate r 0+ and r 0-, respectively. Let P be the common Newton polygon of f t (y) and f -t (y), as polynomials in y and t. Projecting the lower faces of P onto the first (y) coordinate axis gives a single interval I 1 if δ ≤ 0, or the union of two intervals I 1 and I 2 if δ > 0. Here, I 1 = [0, deg(G)], the Newton segment of G and I 2 = [deg(G), deg(F )], which has length δ. For both f t (y) and f -t (y), the polynomial f (1) corresponding to I 1 is just G. If δ > 0, then the polynomial f (2) corresponding to I 2 is the binomial ±M F -M G , which is the difference of the highest degree terms of ±F and G.

Both binomials ±M F -M G have only simple non-zero roots. The polynomial f (1) = G has singular roots if any of λ p+1 , . . . , λ ν are not equal to 1. Since F and G have no common root, the assumptions of Proposition 4.1 are fulfilled for both f t and f -t . The numbers r 0+ and r 0-, hence r 0+ + r 0-and |r 0+ -r 0-|, are sums of contributions of the non-zero real roots of G and of the non-zero real roots of ±M F -M G .

Consider contributions from roots ρ of G, which satisfy ρ ℓ = ζ, where ζ is a root of some g i for p < i ≤ ν. This has multiplicity λ i . If λ i is odd, then ρ contributes 1 to both r 0± and hence 2 to r 0+ + r 0-and 0 to |r 0+ -r 0-|. If λ i is even, then ρ contributes 2 or 0 to r 0+ , depending upon the sign of G/F near ρ. Replacing t by -t, shows that it contributes 2 or 0 to r 0-, depending upon the sign of -G/F near ρ. Thus ρ contributes 2 both to r 0+ + r 0-and to |r 0+ -r 0-|.

Suppose now that δ > 0. Then each non-zero real root of the binomial ±M F -M G is simple and thus contributes 1 to r 0± . Both binomials have only one non-zero real root if

δ is odd. If δ is even, then M F -M G (resp. -M F -M G )
has 0 or 2 (resp. 2 or 0) real roots according as the product of the coefficients of M F and M G is positive or negative. It follows that the roots of these binomials contribute 2 to r 0+ + r 0-, and contribute 0 or 2 to |r 0+ -r 0-| according as δ is odd or even, respectively. Summing up all contributions gives the desired upper bounds for r 0+ + r 0-and |r 0+ -r 0-|.

The upper bounds for r +∞ -r -∞ and |r +∞ -r -∞ | are obtained in exactly the same way if we use the polynomial g t (y) = F (y) -tG(y) instead of f t (y). The Newton polygon Q of g t is the reflection of P in the horizontal line of height 1/2, so that the lower faces of Q are the upper faces of P . They project to 1, 2, or 3 intervals on the first coordinate axis, I 1 = [0, N ] (if N = 0), I 2 = [N, deg(F )], and I 3 = [deg(F ), deg(G)], if δ < 0. The polynomial f (2) corresponding to I 2 is just F , and the other polynomials are binomials.

Finally, assume that ℓ is even, N is odd, and let us prove the last inequality. Using the facts that the non-zero real roots of G come in pairs (ρ, -ρ), the function G/F is an odd function, and that N and δ are both odd integers, we obtain r 0+ ≤ 2k(ν -p) + χ(δ > 0). Similarly, using the polynomial g t (y) = F (y) -tG(y) instead of f t (y), we obtain that r +∞ ≤ 2kp + 1 + χ(δ < 0). Suming up these two inequalities gives the result.

Theorem 4.6. The number r of real solutions to a generic system with support the near circuit C = {0, ℓe n , 2ℓe n , . . . , kℓe n , w 1 , . . . , w n } satisfies the following inequalities

(4.5) r ≤ 2kℓp + kℓ ν i=p+1 λ i + χ(N > 0) + 1 -χ(δ > 0 is odd) -χ(δ = 0) -ℓ (χ(δ = 0) + χ(N = 0)) , and
(4.6) r ≤ 2kℓ(ν -p) + kℓ p i=1 λ i + χ(N > 0 is even) + 1 -χ(δ < 0 is odd) -χ(δ = 0) -ℓ (χ(δ = 0) + χ(N = 0)) ,
where k, ℓ, N, ν, and λ i are defined in Section 3.2.

Moreover, if ℓ is even and N is odd, then we have and this can be obtained if exactly one λ i is odd, N > 0 and even, and δ is even and nonzero. This upper bound is maximized when {0, e n , w 1 , . . . , w n } forms a non degenerate circuit, that is, if no proper subset is affinely dependent. If ℓ is even, the corresponding absolute upper bound is 2kν + 1, and is also maximized when {0, e n , w 1 , . . . , w n } forms a non degenerate circuit.

Proof of Theorem 4.6. Let f be the univariate eliminant of a generic polynomial system with support C, which has the form (3.5). For an interval I ⊂ R, let ∆ I be the (positive) variation in the number of non-zero real roots of f t for t ∈ I. As noted in Remark 4.4, the number of non-zero real roots of f t can change only if t passes through 0, or if t passes through a value c = 0 such that f c has a real singular root. Passing through the value t = 0, the variation of the number of real roots of f t is at most |r 0+ -r 0-|.

Recall that f = f t for t = 1 and that f has no singular roots. Considering the path from t close to -∞ to t = 1, we obtain

r ≤ r -∞ + ∆ (-∞,0) + |r 0+ -r 0-| + ∆ (0,1) .
Considering the path from t close to +∞ to t = 1, we obtain r ≤ r +∞ + ∆ (1,+∞) .

Combining these two inequalities yields

(4.8) r ≤ r +∞ + r -∞ + |r 0+ -r 0-| 2 + ∆ R * 2 .
The number ∆ R * is at most the total multiplicity of the singular real roots of f t for t = 0. By Proposition 4.3, this is at most 2kℓν -2ℓ (χ(δ = 0) + χ(N = 0)). The inequality (4.5) follows then from (4.8) and Proposition 4.5.

Using the polynomial g t = F -tG in place of f t = tF -G, leads to (4.9)

r ≤ r 0+ + r 0-+ |r +∞ -r -∞ | 2 + ∆ R * 2 .
The inequality (4.6) is then obtained using Proposition 4.5.

Finally, considering the paths from t = 0 to t = 1, and from t close to +∞ to t = 1 gives (4.10)

r ≤ r 0+ + r +∞ 2 + ∆ (0,+∞) 2 .
For ℓ even and N odd, the inequality (4.7) comes then from the corresponding statements in Proposition 4.3 and Proposition 4.5.

Constructions and sharp upper bounds

We now construct polynomials f having the form (3.5) with many real roots. In some cases, this achieves the upper bound of Theorem 4.6 for the maximal number of real solutions to generic systems with support a given near circuit. We use Proposition 4.1 to determine the number of real roots for small t > 0 of a polynomial of the form

f t (x) = t a ζ∈R 1 (t -b x ℓ -ζ) m(ζ) -x µ ζ∈R 2 (ζ -x ℓ ) m(ζ) ,
where µ, a, b are positive integers, R 1 and R 2 are disjoint sets of positive real numbers, and m(ζ) is a positive integer for

ζ ∈ R 1 ∪ R 2 . Set µ i := ℓ • ζ∈R i m(ζ).
2) if ζ, ζ ′ ∈ R 2 with m(ζ) even and m(ζ ′ ) odd, then ζ ′ > ζ. Let e (respectively o) be the number of ζ ∈ R 1 ∪ R 2 such that m(ζ) (
is even (respectively odd). If ℓ is odd, then, for t > 0 sufficiently small, f t has exactly 2e + o + µ -µ 1 simple non-zero real roots. If ℓ is even and µ is odd, then, for t > 0 sufficiently small, f t has exactly 2e + 2o + 1 simple non-zero real roots.

Proof. We use the notation of Proposition 4.1. The inequalities µ 1 < aℓ/b < µ imply that the lower hull of P consists of three segments whose projection onto the first coordinate axis are the intervals

I 1 = [0, µ 1 ], I 2 = [µ 1 , µ], and I 3 = [µ, µ + µ 2 ]. The corresponding facial subpolynomials are f (1) (x) = ζ∈R 1 (x ℓ -ζ) m(ζ) f (2) (x) = x µ 1 - ζ∈R 2 ζ m(ζ) • x µ f (3) (x) = -x µ ζ∈R 2 (ζ -x ℓ ) m(ζ) .
Note that ζ∈R 2 ζ m(ζ) > 0 since R 2 consists of positive real numbers. Thus the non-zero roots of the binomial f (2) are simple, with µ -µ 1 of them real. Proposition 4.1 applies as we can see from the expansions (4.1) for f (1) and f (3) .

f t (xt b ℓ )/t a = f (1) (x) -t bµ ℓ -a x µ ζ∈R 2 (ζ -x ℓ t b ) m(ζ) = f (1) (x) -t bµ ℓ -a x µ ( ζ∈R 2 ζ m(ζ) ) + h (1) (x, t) . f t (x) = f (3) (x) + t a ζ∈R 1 (t -b x ℓ -ζ) m(ζ) = f (3) (x) + t a-bµ 1 ℓ x µ 1 + h (3) (x, t) .
Assume that ℓ is odd. Then the map x → x ℓ is a bijection from the real roots of f (1) (resp., f (3) ) to R 1 (resp., R 2 ). Conditions (1) and (2) imply that the contribution of any real root ρ such that

ρ ℓ = ζ ∈ R i and m(ζ) is even is equal to 2.
Assume that ℓ is even and µ is odd. Then the real roots of f (1) (resp., f (3) ) come in pairs (ρ, -ρ) with ρ ℓ = ζ ∈ R 1 (resp., R 2 ). If m(ζ) is odd, then the contributions of ρ and -ρ are both equal to 1. If m(ζ) is even, then one contribution is 2, while the other is 0, as µ is odd. Finally, note that µ -µ 1 = 1 if ℓ is even and µ is odd.

Proof of Theorem 5.1. Set

µ := N + ℓ p i=1 (k -d i )λ i .
The inequality (5.1) can be rewritten as

ℓ ν i=p+1 d i λ i < µ .
Then, by Lemma 5.2 there exist polynomials h 1 , . . . , h n with distinct roots such that h i has degree d i with d i real roots and the polynomial

g(x) := x µ p i=1 (h i (x ℓ )) λ i - ν i=p+1 (h i (x ℓ )) λ i has either ν i=1 d i λ i + d or else 2 ν i=1 d i + 1
simple real roots according as ℓ is odd, or ℓ is even and N is odd, respectively. The polynomial g(x) can be rewritten as

g(x) = x N p i=1 x ℓ(k-d i ) h i (x ℓ ) λ i - ν i=p+1 h i (x) ℓ λ i If d i = k, set g i (x) := h i (x). Otherwise, set g i (x) := ǫ(1 + x + • • • + x k-d i -1 ) + x k-d i h i (x) 1 ≤ i ≤ p g i (x) := h i (x) + ǫ(x d i +1 + • • • + x k ) p + 1 ≤ i ≤ ν .
For sufficiently small ǫ > 0, the polynomial

f (x) = x N p i=1 g i (x ℓ ) λ i - ν i=p+1 g i (x ℓ ) λ i
has simple roots and at least the same number of real roots as g.

Theorem 5.3. Assume that N > kℓ ν i=p+1 λ i and let m be the maximal number of real solutions to a generic system with support the near circuit C.

If ℓ is even, then m = 2kν + 1. Suppose now that ℓ is odd.

(1) If λ 1 , . . . , λ p are even, then

m = 2kp + k ν i=p+1 λ i + δ .
(2) If exactly one number among λ 1 , . . . , λ p is odd, k = ℓ = 1 and δ is odd, then

m = 2p + 1 + ν i=p+1 λ i .
( Proof. We apply Theorem 5.1 with each d i = k. The case of ℓ even is a direct consequence of Theorem 4.6 and Theorem 5.1. Suppose now that ℓ is odd and let B 1 and B 2 be the upper bounds for the number of real solutions to a generic system with support C which are given in Theorem 4.6 by formulas (4.5) and (4.6), respectively. Set

B -:= k ν i=1 λ i + d ,
where d := N -kℓ ν i=p+1 λ i > 0. Note that δ, N ≥ d, so δ, N > 0. By Theorem 5.1, the number B -is a lower bound on the maximal number of real solutions of a generic system with support C.

We check that B 1 ≥ B -and analyze the conditions under which B 1 = B -. As δ > 0 and N > 0, we have

B 1 -B -= k p i=1 (2 -λ i ) + δ -d .
We have

δ -d =      0 if kℓ p i=1 λ i is even 1 if kℓ p
i=1 λ i is odd and d is odd -1 if kℓ p i=1 λ i is odd and d is even If δ -d = 0, then B 1 ≥ B -with equality only if λ 1 , . . . , λ p are even. This proves Part [START_REF] Basu | Algorithms in real algebraic geometry[END_REF].

If δ -d = 1, then B 1 > B -. Assume now that δ -d = -1. Then kℓ p i=1 λ i is odd, d is even and B 1 -B -= kℓ p i=1 (2λ i ) -1. Since kℓ p i=1 λ i is odd, kℓ is odd and at least one number among λ 1 , . . . , λ p is odd. Thus B 1 -B -≥ kℓ -1 with equality only if exactly one number among λ 1 , . . . , λ p is odd. Part (2) now follows.

Parts (3) and ( 4) are similar.

Theorem 5.4. Assume that λ i ∈ {1, 2} for i = 1, . . . , ν, ℓ is odd, and let m be the maximal number of real solutions to a generic system with support the near circuit C. (g i (x)) λ i , where g 1 , . . . , g ν are polynomials of degree k with non-zero constant terms. The lower part of the Newton polygon of f t (x) consists of a single segment projecting onto [0, k ν i=p+1 λ i ]. Hence, if Proposition 4.1 applies, the number of real roots of f t for t > 0 small enough is the sum of contributions of the non-zero real roots of g p+1 , . . . , g ν . Choosing polynomials g 1 , . . . , g ν with distinct roots satisfying conditions (1) If i, j > p, then g i has k positive roots, and if λ i is odd and λ j is even, then the leading coefficient of g i is positive and every root of g i is less than every root of g j . (2) The polynomials g 1 , . . . , g p are positive at each root of of g p+1 , . . . , g ν . By Proposition 4.1, f t has k ν i=p+1 λ i non-zero real roots for t > 0 small enough. which is what we found in Section 1.

Theorem 5.6. The number of real roots of a generic system with support a primitive near circuit C = {0, ℓe n , . . . , kℓe n , w 1 , . . . , w n } in R n is at most (2ν -1)k + 2 if ℓ is odd, or 2kν + 1 if ℓ is even. Moreover, these bounds are sharp.

Proof. As the numbers λ 1 , . . . , λ ν are coprime, at least one is odd. Since λ j ≤ 2, the upper bound for odd ℓ follows from Theorem 4.6 (see Remark 4.7). The sharpness of this bound follows from Theorem 5.4 for a primitive near circuit with all λ 1 , . . . , λ ν but one equal to 2 and one which is equal to 1, and where and N -kℓ ν i=p+1 λ i is positive and even (Example 3.6 shows that such a near circuit exists).

The bound 2kν + 1 for ℓ even comes from Theorem 4.6, its sharpness follows from Theorem 5.3.

A near circuit with k = 1 is just a circuit. The following result is a particular case of previous one.

Theorem 5.7. The number of real roots of a generic system with support a primitive circuit C = {0, ℓe n , , w 1 , . . . , w n } in R n is at most 2ν + 1, and this bound this sharp.

The absolute upper bound for the number of real roots of a generic system with support a primitive circuit in R n is 2n + 1, and this bound is sharp. Moreover, this bound can be attained only for non-degenerate circuits.

(4. 7 ) r ≤ 2kν + 1 Remark 4 . 7 .

 7147 Since λ 1 , . . . , λ ν are relatively prime, we see that the absolute upper bound for such a near circuit with ℓ odd is k(2ν -1) + 2 ,

Theorem 5 . 1 .

 51 Let C be a primitive near circuit with k, ℓ, N , and λ i as in Section 3.2. Suppose that d 1 , . . . , d ν are nonnegative integers with d i ≤ k such that(5.1) ℓ ν i=1 d i λ i < N + kℓ p i=1 λ i .If ℓ is odd, then there is a generic polynomial system with support C having ν i=1d i λ i + dreal solutions, where d is the (positive) difference of the two sides of (5.1). If ℓ is even, hence N is odd, then there is a generic polynomial system with support C having

Lemma 5 . 2 .

 52 Suppose that µ 1 < aℓ/b < µ, and we have further that (1) if ζ, ζ ′ ∈ R 1 with m(ζ) even and m(ζ ′ ) odd, then ζ ′ < ζ, and

)( 4 )

 4 If λ p+1 , . . . , λ n are even, then m = 2k(n -p) + k p i=1 λ i + N . If exactly one number among λ p+1 , . . . , λ n is odd, k = ℓ = 1 and N is odd, then m = 2(n -p)

( 1 )( 2 )λ

 12 If N > kℓ ν i=p+1 λ i , then m = k ν i=1 λ i + N -kℓ ν i=p+1 λ i . Suppose that ℓ = 1. If N < k ν i=p+1 λ i , then m = v(C) = max k ν i=p+1 λ i , N + k p i=1 λ i .Proof. For Part[START_REF] Basu | Algorithms in real algebraic geometry[END_REF], the number m equals the upper bound given by Descartes's rule of signs when applied to a polynomial of the form (3.5). Theorem 5.1 with each d i = k implies the existence of a polynomial with this form with m real roots.For Part (2), we have that N < k ν i=p+1 λ i . If we also haveN + k p i=1 λ i > k ν i=p+1 λ i , then there exist nonnegative integers d 1 , . . . , d ν ≤ k such that d = N + k i d i ∈ {1, 2} ,as λ i ∈ {1, 2}. By Theorem 5.1, there exists a polynomial of the form (3.5) havingν i=1 λ i d i + d = N + k p i=1 λ i non-zero real roots. Finally, suppose that N + k p i=1 λ i ≤ k ν i=p+1 λ i . Consider a polynomial f t (x) = t • x N p i=1 (g i (x)) λ i -ν i=p+1

Remark 5 . 5 .

 55 The example of Section 2 is a special case of Part(1) of Theorem 5.4. Indeed, in Section 2, we have w 0 = e n , w i = e i i = 1, . . . , n-1, and w n = ǫ i e i + le n , so that N = l, ν = |ǫ| + 1 = i λ i , and p = |ǫ| . Then the maximum number of Part(1) of Theorem 5.4 is m = k(|ǫ| + 1) + l -k ,

  . . . , . . . , n . of a univariate polynomial is singular if it has multiplicity greater than 1.

	For any integer a, define a ∈ {0, 1, 2} by   2 if a is positive and even
	a :=		1 if a is positive and odd 0 otherwise
	A root ρ

Proof. We only need to prove the last sentence as the others are corollaries of Theorem 5.6. For this, we note that the bound 2ν + 1 is obtained when δ and N are non-zero. Hence the absolute bound 2n + 1 is obtained when ν = n, δ and N are non-zero, which is exactly the case of a non-degenerate circuit.

Part of work done at MSRI was supported by NSF grant DMS-9810361. Work of Sottile is supported by the Clay Mathematical Institute. Sottile and Bihan were supported in part by NSF CAREER grant DMS-0134860. Bertrand is supported by the European research network IHP-RAAG contract HPRN-CT-2001-00271.