Groebner Bases Applied to Systems of Linear Difference Equations

Simple item page
dc.creatorGerdt, V. P.
dc.date2006-11-09
dc.date.accessioned2026-07-07T07:31:41Z
dc.date.available2026-07-07T07:31:41Z
dc.descriptionIn this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high energy physics as recurrence relations for multiloop Feynman integrals. The most universal algorithmic tool for investigation of linear difference systems is based on their transformation into an equivalent Groebner basis form. We present an algorithm for this transformation implemented in Maple. The algorithm and its implementation can be applied to automatic generation of difference schemes for linear partial differential equations and to reduction of Feynman integrals. Some illustrative examples are given.
dc.description10 pages, Particles and Nuclei, Letters, to appear
dc.identifierhttps://arxiv.org/abs/cs/0611041
dc.identifierhttp://arxiv.org/abs/cs/0611041
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/118839
dc.subjectSymbolic Computation
dc.subjectI.1.2; I.1.4
dc.titleGroebner Bases Applied to Systems of Linear Difference Equations
dc.typetext

Files

Collections

arXiv