Factoring sparse resultants of linearly combined polynomials

This paper is part of the author's work on determining the irreducible factors of sparse (toric) resultants of composed polynomials. The motivation behind this work is to use the factors for efficient elimination of variables, by sparse resultant computation, from composed polynomials. Previous works considered the sparse (toric) resultant of polynomials having arbitrary (mixed) supports composed with (i.e. evaluated at) polynomials having the same (unmixed) supports and of polynomials having the same (unmixed) supports composed with polynomials having arbitrary (mixed) supports, resp. Here, we consider the sparse resultant of linear polynomials having arbitrary (mixed) supports composed with polynomials having arbitrary (mixed) supports, also called "linearly combined polynomials", (under a natural assumption on their exponents). The main contribution of this paper is to determine the irreducible factors, together with their exponents, of the sparse resultant of these linearly combined polynomials. This result essentially generalizes a result by Gelfand, Kapranov and Zelevinsky factoring the sparse resultant of unmixed dense linear polynomials composed with polynomials with unmixed supports. It is expected that this result can be applied to eliminate variables from linearly combined polynomials with improved efficiency.

[1]  Alicia Dickenstein,et al.  Residues and Resultants , 1997, alg-geom/9702001.

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

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

[4]  Patrik Nordbeck SAGBI Bases Under Composition , 2002, J. Symb. Comput..

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

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

[7]  Deepak Kapur,et al.  Extraneous factors in the Dixon resultant formulation , 1997, ISSAC.

[8]  Manfred Minimair,et al.  Sparse Resultant of Composed Polynomials IMixed-. Unmixed Case , 2002, J. Symb. Comput..

[9]  Manfred Minimair Dense resultant of composed polynomials: Mixed-mixed case , 2003, J. Symb. Comput..

[10]  Charles Ching-An Cheng,et al.  A chain rule for multivariable resultants , 1995 .

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

[12]  M. Stark,et al.  THE THEORY OF ELIMINATION , 1964 .

[13]  Manfred Minimair,et al.  Sparse Resultant of Composed Polynomials II. Unmixed-Mixed Case , 2002, Journal of symbolic computation.

[14]  T. Willmore Algebraic Geometry , 1973, Nature.

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

[16]  Hoon Hong Subresultants Under Composition , 1997, J. Symb. Comput..

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

[18]  Hoon Hong Groebner Basis Under Composition I , 1998, J. Symb. Comput..

[19]  Jaime Gutierrez,et al.  Reduced Gröbner Bases Under Composition , 1998, J. Symb. Comput..

[20]  Bernd Sturmfels,et al.  On the Newton Polytope of the Resultant , 1994 .

[21]  C. D'Andrea,et al.  Explicit formulas for the multivariate resultant , 2000, math/0007036.

[22]  L. Gonzalez-Vega Une théorie des sous-résultants pour les polynômes en plusieurs variables , 1991 .

[23]  Deepak Kapur,et al.  Sparsity considerations in Dixon resultants , 1996, STOC '96.

[24]  Erich Kaltofen,et al.  Solving systems of nonlinear polynomial equations faster , 1989, ISSAC '89.

[25]  Victor Y. Pan,et al.  The structure of sparse resultant matrices , 1997, ISSAC.

[26]  D. Kirby THE ALGEBRAIC THEORY OF MODULAR SYSTEMS , 1996 .

[27]  Dinesh Manocha,et al.  Multipolynomial Resultant Algorithms , 1993, J. Symb. Comput..

[28]  J. Maurice Rojas,et al.  Solving Degenerate Sparse Polynomial Systems Faster , 1998, J. Symb. Comput..

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

[30]  Peter F. Stiller,et al.  Solving the recognition problem for six lines using the Dixon resultant 1 Expanded version of talks , 1999 .

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

[32]  M. Singer,et al.  Calculating the Galois group of L1(L2(y))=0,L1,L2 completely reducible operators , 1999 .

[33]  Manfred Minimair Sparse Resultant under Vanishing Coefficients , 2003 .