Subresultants and Generic Monomial Bases

Simple item page
dc.creatorD'Andrea, Carlos
dc.creatorJeronimo, Gabriela
dc.date2003-01-30
dc.date2004-02-04
dc.date.accessioned2026-07-07T04:54:46Z
dc.date.available2026-07-07T04:54:46Z
dc.descriptionGiven 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.
dc.description22 pages, uses elsart.cls. Revised version accepted for publication in the Journal of Symbolic Computation
dc.identifierhttps://arxiv.org/abs/math/0301355
dc.identifierhttp://arxiv.org/abs/math/0301355
dc.identifierJournal of Symbolic Computation 39 (2005) 259-277
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/66391
dc.subjectAlgebraic Geometry
dc.subjectCommutative Algebra
dc.subject13Pxx (Primary), 68W30 (Secondary)
dc.titleSubresultants and Generic Monomial Bases
dc.typetext

Files

Collections

arXiv