Ore Polynomials in Sage

Manuel Kauers; Maximilian Jaroschek; Fredrik Johansson

Ore Polynomials in Sage

Manuel Kauers
, Maximilian Jaroschek
, Fredrik Johansson

Research output: Chapter in Book/Report/Conference proceeding › Conference proceedings › peer-review

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.

Original language	English
Title of host publication	Computer Algebra and Polynomials
Editors	Jaime Gutierrez, Josef Schicho, Martin Weimann
Number of pages	17
Publication status	Published - 2014

Publication series

Name	Lecture Notes in Computer Science (LNCS)

Fields of science

101 Mathematics
101001 Algebra
101005 Computer algebra
101009 Geometry
101012 Combinatorics
101013 Mathematical logic
101020 Technical mathematics

JKU Focus areas

Computation in Informatics and Mathematics

Cite this

@inproceedings{2058d4f974594d4198b539dd5d0d48fc,

title = "Ore Polynomials in Sage",

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.",

author = "Manuel Kauers and Maximilian Jaroschek and Fredrik Johansson",

year = "2014",

language = "English",

series = "Lecture Notes in Computer Science (LNCS)",

editor = "\{Jaime Gutierrez, Josef Schicho, Martin Weimann\}",

booktitle = "Computer Algebra and Polynomials",

}

TY - GEN

T1 - Ore Polynomials in Sage

AU - Kauers, Manuel

AU - Jaroschek, Maximilian

AU - Johansson, Fredrik

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

M3 - Conference proceedings

T3 - Lecture Notes in Computer Science (LNCS)

BT - Computer Algebra and Polynomials

A2 - Jaime Gutierrez, Josef Schicho, Martin Weimann, null

ER -