In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of the known results of subresultants are recovered, some with more precision, without using Euclidean divisions or existence of roots for univariate polynomials. The main contributions of this paper are not new results on subresultants, but rather extensions of the main results over integral rings to arbitrary commutative rings
AbstractWe present a matrix formalism to study univariate polynomials. The structure of this formali...
In this paper we establish a connection between subresultants and locally nilpotent derivations ove...
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...
In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of ...
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. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Mad...
AbstractWe give a rational expression for the subresultants of n+1 generic polynomials f1,…,fn+1 in ...
AbstractWe give a rational expression for the subresultants of n+1 generic polynomials f1,…,fn+1 in ...
AbstractIn this text, we will introduce the natural generalization of the so-called subresultants of...
AbstractThe Habicht approach to the theory of subresultants is based on studying polynomial remainde...
AbstractGiven n polynomials in n variables of respective degrees d1,…,dn, and a set of monomials of ...
AbstractA general subresultant method is introduced to compute elements of a given ideal with few te...
AbstractThe Habicht approach to the theory of subresultants is based on studying polynomial remainde...
AbstractWe present a matrix formalism to study univariate polynomials. The structure of this formali...
In this paper we establish a connection between subresultants and locally nilpotent derivations ove...
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...
In this paper we give an elementary approach to univariate polynomial subresultants theory. Most of ...
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. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
Available from Centro de Informacion y Documentacion Cientifica CINDOC. Joaquin Costa, 22. 28002 Mad...
AbstractWe give a rational expression for the subresultants of n+1 generic polynomials f1,…,fn+1 in ...
AbstractWe give a rational expression for the subresultants of n+1 generic polynomials f1,…,fn+1 in ...
AbstractIn this text, we will introduce the natural generalization of the so-called subresultants of...
AbstractThe Habicht approach to the theory of subresultants is based on studying polynomial remainde...
AbstractGiven n polynomials in n variables of respective degrees d1,…,dn, and a set of monomials of ...
AbstractA general subresultant method is introduced to compute elements of a given ideal with few te...
AbstractThe Habicht approach to the theory of subresultants is based on studying polynomial remainde...
AbstractWe present a matrix formalism to study univariate polynomials. The structure of this formali...
In this paper we establish a connection between subresultants and locally nilpotent derivations ove...
Given the polynomials f, g ∈ Z[x] the main result of our paper, Theorem 1, establishes a direct one...
DOI
Add to ORKG