A Subresultant Theory for Ore Polynomials with Applications

The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresultant algorithm. Using this generalization, we de ne Sylvester's resultant of two Ore polynomials, derive the respective determinantal formulas for the greatest common right divisor and least common left multiple of two Ore polynomials, and present a fraction-free version of the noncommutative extended Euclidean algorithm.

• Type: Conference
• Year: 1998
• Where: ISSAC
• Authors: Ziming Li
• Keywords: Common Right Divisor, ISSAC 1998, Mathematics, Ore Polynomials, Univariate Commutative Polynomials