Add to ORKGAbstract. We establish a connection between the D-resultant of two polynomials f(t) and g(t) and the subresultant sequence of f(t) − x and g(t) − y. This connection is used to decide in a more explicit way whether K(f(t), g(t)) = K(t) or K[f(t), g(t)] = K[t]. We also show how to extract a faithful parametrization from a given one. 1
Abstract. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
Abstract. Let k be a field of characteristic zero and let f ∈ k[x]. The m-th cyclic resultant of f i...
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving ...
In this paper we introduce the D-resultant of two rational functions f(t), g(t) ≤ K(t) and show how ...
We introduce the D-resultant of two polynomials in one variable and show how it can be used to decid...
Consider two differential operators L 1 = P a i d i and L 2 = P b j d j with coefficients in...
Consider two differential operators L1 = � aid i and L2 = � bjd j with coefficients in a different...
It is a well known fact that the resultants are invariant under translation. We extend this fact to ...
AbstractLet I be an integral domain and let f, g, h be polynomials in x over I with positive degrees...
We review classical concepts of resultants of algebraic polynomials, and we adapt some of these conc...
We review classical concepts of resultants of algebraic polynomials, and we adapt some of these conc...
Given the polynomials f, g ∈ Z[x] of degrees n, m, respectively, with n > m, three new, and easy to ...
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...
AbstractSubresultants appear to be approximants of the resultant, and can be defined, in the univari...
Abstract. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
Abstract. Let k be a field of characteristic zero and let f ∈ k[x]. The m-th cyclic resultant of f i...
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving ...
In this paper we introduce the D-resultant of two rational functions f(t), g(t) ≤ K(t) and show how ...
We introduce the D-resultant of two polynomials in one variable and show how it can be used to decid...
Consider two differential operators L 1 = P a i d i and L 2 = P b j d j with coefficients in...
Consider two differential operators L1 = � aid i and L2 = � bjd j with coefficients in a different...
It is a well known fact that the resultants are invariant under translation. We extend this fact to ...
AbstractLet I be an integral domain and let f, g, h be polynomials in x over I with positive degrees...
We review classical concepts of resultants of algebraic polynomials, and we adapt some of these conc...
We review classical concepts of resultants of algebraic polynomials, and we adapt some of these conc...
Given the polynomials f, g ∈ Z[x] of degrees n, m, respectively, with n > m, three new, and easy to ...
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...
AbstractSubresultants appear to be approximants of the resultant, and can be defined, in the univari...
Abstract. The subresultant theory for univariate commutative polynomials is generalized to Ore polyn...
Abstract. Let k be a field of characteristic zero and let f ∈ k[x]. The m-th cyclic resultant of f i...
In Computer Algebra, Subresultant Theory provides a powerful method to construct algorithms solving ...