Ore Polynomials in Sage

2013/06/18 by Manuel Kauers, Kauers, Manuel, Maximilian Jaroschek +3 · 4 citations
Computer Science · Mathematics · #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Symbolic Computation (cs.SC) #cs.SC #math.CO

paper · pdf · doi:10.48550/arxiv.1306.4263

arxiv created 2013/06/18 · arxiv updated 2013/06/19

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.

Cited by

• The two-mass contributions to the three-loop massive operator matrix elements A_Qg⁽³⁾ and ΔA_Qg⁽³⁾
• Galois Groups of Symmetric Cubic Surfaces
• Exact solution of asymmetric gelation between three walks on the square lattice
• Periods of fibre products of elliptic surfaces and the Gamma conjecture

Related

• A SageTeX Hypermatrix Algebra Package
• Fast polynomial evaluation and composition
• Computational Tutorial on Gröbner bases embedding Sage in LaTeX with SageTEX
• Factoring Ore polynomials over \mathbbF_q(t) is difficult
• Computing the bound of an Ore polynomial. Applications to factorization