Department of Mathematics
Server

Subresultant theory is a powerful method to control the coefficient growth problem in the Euclidean algorithm. This talk is about a generalized version of the subresultant theory from commutative polynomials to linear differential, linear difference and Ore polynomials. Topics including an overview of linear operators, univariate Ore polynomials, and algorithms to determine formulas for computing subresultant polynomial remainder sequences in noncommutative rings.