arXiv Analytics

Sign in

arXiv:math-ph/0509050AbstractReferencesReviewsResources

On Computation of Groebner Bases for Linear Difference Systems

Vladimir P. Gerdt

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.

Related articles: Most relevant | Search more
arXiv:1103.5213 [math-ph] (Published 2011-03-27, updated 2012-07-06)
On the computation of star products
arXiv:0907.0689 [math-ph] (Published 2009-07-03)
Computation of fluxes of conservation laws
arXiv:1302.5040 [math-ph] (Published 2013-02-20, updated 2015-01-24)
Dyson-Schwinger equations in the theory of computation