A Maple Package for Computing Groebner Bases for Linear Recurrence Relations
arXiv:cs/0509070 · doi:10.1016/j.nima.2005.11.171
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
5 pages, presented at ACAT-2005
References in corpus (1)
Cited by in corpus (8)
- Towards a Basis for Planar Two-Loop Integrals
- FIRE 6.5: Feynman Integral Reduction with New Simplification Library
- Gröbner Bases and Generation of Difference Schemes for Partial Differential Equations
- Feynman integral reduction using Gröbner bases
- On Computation of Groebner Bases for Linear Difference Systems
- IBP reduction via Gröbner bases in a rational double-shift algebra
- Computation of Difference Groebner Bases
- Groebner bases and gradings for partial difference ideals