Subresultants and Generic Monomial Bases
Algebraic Geometry
2007-05-23 v3 Commutative Algebra
Abstract
Given n polynomials in n variables of respective degrees d_1,...,d_n, and a set of monomials of cardinality d_1...d_n, 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.
Cite
@article{arxiv.math/0301355,
title = {Subresultants and Generic Monomial Bases},
author = {Carlos D'Andrea and Gabriela Jeronimo},
journal= {arXiv preprint arXiv:math/0301355},
year = {2007}
}
Comments
22 pages, uses elsart.cls. Revised version accepted for publication in the Journal of Symbolic Computation