A Maple Package for Computing Groebner Bases for Linear Recurrence Relations
<|reference_start|>A Maple Package for Computing Groebner Bases for Linear Recurrence Relations: 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<|reference_end|>
@article{gerdt2005a,
    title={A Maple Package for Computing Groebner Bases for Linear Recurrence
  Relations},
    author={Vladimir P. Gerdt and Daniel Robertz},
    journal={Nucl.Instrum.Meth. A559 (2006) 215-219},
    year={2005},
    doi={10.1016/j.nima.2005.11.171},
    archivePrefix={arXiv},
    eprint={cs/0509070},
    primaryClass={cs.SC cs.MS}
}