The Gröbner basis algorithm and subresultant theory
Ana Maria Mandache · 1994
We investigate the possibility of constructing for Gro¨bner bases a concept similar to the one provided by subresultants for polynomial remainder sequences. Namely, we try to express the Gro¨bner basis polynomials obtained during the algorithm in terms of matrices having on each row the coefficients of a polynomial from the input basis, shifted by multiplication with a power product.