2003/01/31 by Carlos D'Andrea, Gabriela Jeronimo
Mathematics · #math.AG #math.AC #msc:13Pxx #msc:68W30
published as Journal of Symbolic Computation 39 (2005) 259-277 · 22 pages, uses elsart.cls. Revised version accepted for publication in the Journal of Symbolic Computation
arxiv created 2004/02/04 · arxiv updated 2009/11/30
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 Bezout construction of the resultant.