Conditions for determinantal formula for resultant of a polynomial system

Matrices constructed from a parameterized multivariate polynomial system are analyzed to ensure that such a matrix contains a condition for the polynomial system to have common solutions irrespective of whether its parameters are specialized or not. Such matrices include resultant matrices constructed using well-known methods for computing resultants over projective, toric and affine varieties. Conditions on these matrices are identified under which the determinant of a maximal minor of such a matrix is a nontrivial multiple of the resultant over a given variety. This condition on matrices allows a generalization of a linear algebra construction, called rank submatrix, for extracting resultants from singular resultant matrices, as proposed by Kapur, Saxena and Yang in ISSAC'94. This construction has been found crucial for computing resultants of non-generic, specialized multivariate polynomial systems that arise in practical applications. The new condition makes the rank submatrix construction based on maximal minor more widely applicable by not requiring that the singular resultant matrix have a column independent of the remaining columns. Unlike perturbation methods, which require introducing a new variable, rank submatrix construction is faster and effective. Properties and conditions on symbolic matrices constructed from a polynomial system are discussed so that the resultant can be computed as a factor of the determinant of a maximal non-singular submatrix.

[1]  Bernard Mourrain,et al.  Generalized Resultants over Unirational Algebraic Varieties , 2000, J. Symb. Comput..

[2]  Franck Aries,et al.  An Implicitization Algorithm for Rational Surfaces with no Base Points , 2001, J. Symb. Comput..

[3]  Dinesh Manocha,et al.  Implicit Representation of Rational Parametric Surfaces , 1992, J. Symb. Comput..

[4]  I. Shafarevich,et al.  Basic algebraic geometry 1 (2nd, revised and expanded ed.) , 1994 .

[5]  Bernard Mourrain,et al.  Using projection operators in computer aided geometric design , 2003 .

[6]  Ioannis Z. Emiris,et al.  Hybrid Sparse Resultant Matrices for Bivariate Polynomials , 2002, J. Symb. Comput..

[7]  Hoon Hong,et al.  Testing Stability by Quantifier Elimination , 1997, J. Symb. Comput..

[8]  J. Canny,et al.  Efficient Incremental Algorithms for the , 1994 .

[9]  A. L. Dixon.  The Eliminant of Three Quantics in two Independent Variables , 1909 .

[10]  Deepak Kapur,et al.  Algebraic and geometric reasoning using Dixon resultants , 1994, ISSAC '94.

[11]  Bernard Mourrain,et al.  Resultant over the residual of a complete intersection , 2001 .

[12]  Deepak Kapur,et al.  A new sylvester-type resultant method based on the dixon-bezout formulation , 2003 .

[13]  I. Shafarevich.  Basic algebraic geometry , 1974 .

[14]  J. Jouanolou,et al.  Le formalisme du résultant , 1991 .

[15]  Thomas W. Sederberg,et al.  Implicitizing rational surfaces with base points using the method of moving surfaces , 2003 .

[16]  Bernard Mourrain,et al.  Matrices in Elimination Theory , 1999, J. Symb. Comput..

[17]  Ioannis Z. Emiris,et al.  Sparse elimination and applications in kinematics , 1994 .

[18]  Bernd Sturmfels,et al.  Product formulas for resultants and Chow forms , 1993 .

[19]  Amit Khetan.  The resultant of an unmixed bivariate system , 2003, J. Symb. Comput..

[20]  I. M. Gelʹfand,et al.  Discriminants, Resultants, and Multidimensional Determinants , 1994 .

[21]  John F. Canny,et al.  A subdivision-based algorithm for the sparse resultant , 2000, JACM.

[22]  Tushar Saxena,et al.  Efficient variable elimination using resultants , 1997 .

[23]  David A. Cox,et al.  Using Algebraic Geometry , 1998 .