Summary: Univariate Ore Polynomial Rings in Computer
Algebra
S. A. Abramov #
Dorodnicyn Computing Centre
Russian Academy of Science
Moscow, Russia
abramov@ccas.ru
H. Q. Le + , Z. Li +
Symbolic Computation Group
University of Waterloo
Waterloo, Canada
{hqle,z6li}@scg.math.uwaterloo.ca
Abstract
We present some algorithms related to rings of Ore polynomials (or
Ore rings for short), and describe a computer algebra library for basic
operations in an arbitrary Ore ring. The library can be used as a basis
for various algorithms in Ore rings, in particular in di#erential, shift,
and q­shift rings.
1 Introduction
The theory of Ore rings opens an opportunity to consider linear ordinary dif­

Source: Abramov, Sergei A. - Dorodnicyn Computing Centre of the Russian Academy of Sciences

Collections: Mathematics; Computer Technologies and Information Sciences