Ore Polynomials in Sage
Symbolic Computation
2013-06-19 v1 Combinatorics
Abstract
We present a Sage implementation of Ore algebras. The main features for the most common instances include basic arithmetic and actions; gcrd and lclm; D-finite closure properties; natural transformations between related algebras; guessing; desingularization; solvers for polynomials, rational functions and (generalized) power series. This paper is a tutorial on how to use the package.
Keywords
Cite
@article{arxiv.1306.4263,
title = {Ore Polynomials in Sage},
author = {Manuel Kauers and Maximilian Jaroschek and Fredrik Johansson},
journal= {arXiv preprint arXiv:1306.4263},
year = {2013}
}