AbstractLet I be an integral domain and let f, g, h be polynomials in x over I with positive degrees m, n and k. McKay and Wang proved that res(f∘h,g∘h)=[lc(h)mnres(f,g)]k where res(f,g) denotes the resultant of f and g, and lc(h) denotes the leading coefficient of h. In this paper we extend the result to that of subresultants
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...
We provide explicit formulae for the coefficients of the order-d polynomial subresultant of (x−α)m a...
AbstractA general subresultant method is introduced to compute elements of a given ideal with few te...
AbstractLet I be an integral domain and let f, g, h be polynomials in x over I with positive degrees...
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving ...
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving ...
Abstract. We establish a connection between the D-resultant of two polynomials f(t) and g(t) and the...
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when appl...
AbstractWe give a rational expression for the subresultants of n+1 generic polynomials f1,…,fn+1 in ...
In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of ...
In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of ...
Abstract. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
International audienceWe provide explicit formulae for the coefficients of the order-d polynomial su...
Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Mad...
AbstractIn this text, we will introduce the natural generalization of the so-called subresultants of...
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...
We provide explicit formulae for the coefficients of the order-d polynomial subresultant of (x−α)m a...
AbstractA general subresultant method is introduced to compute elements of a given ideal with few te...
AbstractLet I be an integral domain and let f, g, h be polynomials in x over I with positive degrees...
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving ...
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving ...
Abstract. We establish a connection between the D-resultant of two polynomials f(t) and g(t) and the...
Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when appl...
AbstractWe give a rational expression for the subresultants of n+1 generic polynomials f1,…,fn+1 in ...
In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of ...
In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of ...
Abstract. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
International audienceWe provide explicit formulae for the coefficients of the order-d polynomial su...
Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Mad...
AbstractIn this text, we will introduce the natural generalization of the so-called subresultants of...
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...
We provide explicit formulae for the coefficients of the order-d polynomial subresultant of (x−α)m a...
AbstractA general subresultant method is introduced to compute elements of a given ideal with few te...
DOI
Add to ORKG