A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Ore Polynomials in Sage
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
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.
doi:10.1007/978-3-319-15081-9_6
fatcat:r4rdky3jrrc7nahdgjcbc7uxiu