On Computation of Groebner Bases for Linear Difference Systems
arXiv:math-ph/0509050 · doi:10.1016/j.nima.2005.11.141
Abstract
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The algorithm is an adaptation to difference ideals of our polynomial algorithm based on Janet-like reductions.
5 pages, presented at ACAT-2005