Resultant over the residual of a complete intersection
Busé, Laurent ; Elkadi, Mohamed ; Mourrain, Bernard
HAL, inria-00099487 / Harvested from HAL
In this article, we study the residual resultant which is the necessary and sufficient condition for a polynomial system F to have a solution in the residual of a variety, defined here by a complete intersection G. We show that it corresponds to an irreducible divisor and give an explicit formula for its degree in the coefficients of each polynomial. Using the resolution of the ideal (F:G) and computing its regularity, we give a method for computing the residual resultant using a matrix which involves a Macaulay and a Bezout part. In particular, we show that this resultant is the gcd of all the maximal minors of this matrix. We illustrate our approach for the residual of points and end by some explicit examples.
Publié le : 2001-07-05
Classification:  [INFO.INFO-SC]Computer Science [cs]/Symbolic Computation [cs.SC],  [MATH.MATH-AC]Mathematics [math]/Commutative Algebra [math.AC],  [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]
@article{inria-00099487,
     author = {Bus\'e, Laurent and Elkadi, Mohamed and Mourrain, Bernard},
     title = {Resultant over the residual of a complete intersection},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/inria-00099487}
}
Busé, Laurent; Elkadi, Mohamed; Mourrain, Bernard. Resultant over the residual of a complete intersection. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/inria-00099487/