On Computation of Groebner Bases for Linear Difference Systems
From MaRDI portal
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.
This page was built for publication: On Computation of Groebner Bases for Linear Difference Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6469532)