pith. sign in

arxiv: cs/0509070 · v2 · submitted 2005-09-22 · 💻 cs.SC · cs.MS

A Maple Package for Computing Groebner Bases for Linear Recurrence Relations

classification 💻 cs.SC cs.MS
keywords differencelinearpackagebasescomputinggroebnermaplealgorithm
0
0 comments X
read the original abstract

A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for example, for automatic generation of difference schemes for linear partial differential equations and for reduction of multiloop Feynman integrals. These two possible applications are illustrated by simple examples of the Laplace equation and a one-loop scalar integral of propagator type

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.