# A subresultant theory of multivariate polynomials.

Extracta Mathematicae (1990)

• Volume: 5, Issue: 3, page 150-152
• ISSN: 0213-8743

top

## Abstract

top
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving problems for polynomials in one variable in an optimal way. So, using this method we can compute the greatest common divisor of two polynomials in one variable with integer coefficients avoiding the exponential growth of the coefficients that will appear if we use the Euclidean Algorithm.In this note, generalizing a forgotten construction appearing in [Hab], we extend the Subresultant Theory to the multivariate case. In order to achieve this, first of all, we introduce the definition of subresultant sequence associated to two polynomials in one variable with coefficients in an integral domain and the properties of this sequence that we would like to extend to the multivariate case.

## How to cite

top

González Vega, Laureano. "A subresultant theory of multivariate polynomials.." Extracta Mathematicae 5.3 (1990): 150-152. <http://eudml.org/doc/39898>.

@article{GonzálezVega1990,
abstract = {In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving problems for polynomials in one variable in an optimal way. So, using this method we can compute the greatest common divisor of two polynomials in one variable with integer coefficients avoiding the exponential growth of the coefficients that will appear if we use the Euclidean Algorithm.In this note, generalizing a forgotten construction appearing in [Hab], we extend the Subresultant Theory to the multivariate case. In order to achieve this, first of all, we introduce the definition of subresultant sequence associated to two polynomials in one variable with coefficients in an integral domain and the properties of this sequence that we would like to extend to the multivariate case.},
author = {González Vega, Laureano},
journal = {Extracta Mathematicae},
keywords = {Algebra computacional; Polinomios; Algoritmos numéricos; Anillos de polinomios; Teoría de subresultantes; gcd calculations; subresultant},
language = {eng},
number = {3},
pages = {150-152},
title = {A subresultant theory of multivariate polynomials.},
url = {http://eudml.org/doc/39898},
volume = {5},
year = {1990},
}

TY - JOUR
AU - González Vega, Laureano
TI - A subresultant theory of multivariate polynomials.
JO - Extracta Mathematicae
PY - 1990
VL - 5
IS - 3
SP - 150
EP - 152
AB - In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving problems for polynomials in one variable in an optimal way. So, using this method we can compute the greatest common divisor of two polynomials in one variable with integer coefficients avoiding the exponential growth of the coefficients that will appear if we use the Euclidean Algorithm.In this note, generalizing a forgotten construction appearing in [Hab], we extend the Subresultant Theory to the multivariate case. In order to achieve this, first of all, we introduce the definition of subresultant sequence associated to two polynomials in one variable with coefficients in an integral domain and the properties of this sequence that we would like to extend to the multivariate case.
LA - eng
KW - Algebra computacional; Polinomios; Algoritmos numéricos; Anillos de polinomios; Teoría de subresultantes; gcd calculations; subresultant
UR - http://eudml.org/doc/39898
ER -

## NotesEmbed?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.