GENERALIZED CHARACTERISTIC-POLYNOMIALS

Multipolynomial resultants provide the most efficient methods known (in terms as asymptoticcomplexity) for solving certain systems of polynomial equations or eliminating variables (Bajaj et al., 1988). The resultant of f1, …, fn in K[x1,…,xm] will be a polynomial in m-n+1 variables which is zero when the system f1=0 has a solution in m ( the algebraic closure of K). Thus the resultant defines a projection operator from m to m-n+1. However, resultants are only exact conditions for homogeneous systems, and in the affine case just mentioned, the resultant may be zero even if the system has no affine solution. This is most serious when the solution set of the system of polynomials has “excess components” (components of dimension >m-n), which may not even be affine, since these cause the resultant to vanish identically. In this paper we describe a projection operator which is not identically zero, but which is guaranteed to vanish on all the proper (dimension=m-n) components of the system fi=0. Thus it fills the role of a general affine projection operator or variable elimination “black box” which can be used for arbitrary polynomial systems. The construction is based on a generalisation of the characteristic polynomial of a linear system to polynomial systems. As a corollary, we give a single-exponential time method for finding all the isolated solution points of a system of polynomials, even in the presence of infinitely many solutions, at infinity or elsewhere. © 1990, Academic Press Limited. All rights reserved.