| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9652873 | Journal of Symbolic Computation | 2005 | 19 Pages |
Abstract
Given n polynomials in n variables of respective degrees d1,â¦,dn, and a set of monomials of cardinality d1â¯dn, we give an explicit subresultant-based polynomial expression in the coefficients of the input polynomials whose non-vanishing is a necessary and sufficient condition for this set of monomials to be a basis of the ring of polynomials in n variables modulo the ideal generated by the system of polynomials. This approach allows us to clarify the algorithms for the Bézout construction of the resultant.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Carlos D'Andrea, Gabriela Jeronimo,