The RightEuclidean(Poly1, Poly2, A) calling sequence returns a list [m, S] where m is a positive integer and S is an array with m elements storing the subresultant sequence of the first kind of Poly1 and Poly2.

If Poly1 and Poly2 are fraction-free, and the commutation rule of the Ore algebra A are also fraction-free, then the output of RightEuclidean is fraction-free.

If the optional fourth argument to the RightEuclidean command c1 is specified, the first co-sequence of Poly1 and Poly2 is assigned to c1, so that:

and c1[m+1] Poly2 is a least common left multiple (LCLM) of Poly1 and Poly2.

If the optional fifth argument to the RightEuclidean command c2 is specified, the second co-sequence of Poly1 and Poly2 is assigned to c2, so that:

and c1[m+1] Poly2 = - c2[m+1] Poly1 is an LCLM of Poly1 and Poly2.

The RightPseudoRemainder(Poly1, Poly2, A) calling sequence returns the right pseudo-remainder R of Poly1 and Poly2 such that:

where the degree of R is less than that of Poly2, pquo is the right pseudo-quotient, and mult (the multiplier) is the  sigma power of the leading coefficient of Poly2.

If the fourth argument 'mult' is specified, it is assigned the multiplier defined above. If the fifth argument 'pquo' is specified, it is assigned the right pseudo-quotient defined above.

The RightPseudoQuotient(Poly1, Poly2, A) calling sequence returns the right pseudo-quotient Q of Poly1 and Poly2 such that:

where the degree of the right pseudo-remainder prem is less than that of Poly2 and mult (the multiplier) is the  sigma power of the leading coefficient of Poly2.

If the fourth argument 'mult' is specified, it is assigned the multiplier defined above. If the fifth argument 'prem' is specified, it is assigned the right pseudo-remainder defined above.

Li, Z. "A subresultant theory for Ore polynomials with applications." Proc. of ISSAC'98. pp. 132-139. Edited by O. Gloor. ACM Press, 1998.