Ore Polynomials in Sage [chapter]

Manuel Kauers, Maximilian Jaroschek, Fredrik Johansson
2015 Lecture Notes in Computer Science  
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