Subresultants and generic monomial bases

DOI10.1016/J.JSC.2004.11.003MaRDI QIDQ2456543zbMATH OpenOpenAlexFDO

Authors Carlos D'Andrea, Gabriela Jeronimo

Publication date 19 October 2007

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0301355

determinant of complexes multivariate resultants multivariate subresultants

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

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.

Recommendations

Cites work

Cited in

(8)

This page was built for publication: Subresultants and generic monomial bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456543)