arXiv:math-ph/0509050AbstractReferencesReviewsResources
On Computation of Groebner Bases for Linear Difference Systems
Published 2005-09-22Version 1
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.
Comments: 5 pages, presented at ACAT-2005
Keywords: linear difference systems, computation, ground difference field, computing groebner bases, linear ideals
Tags: journal article
Related articles: Most relevant | Search more
On the computation of star products
arXiv:0907.0689 [math-ph] (Published 2009-07-03)
Computation of fluxes of conservation laws
Dyson-Schwinger equations in the theory of computation