An improved version of standard bases

From MaRDI portal





The author wants to give a very general framework to define standard (Gröbner) bases. The basic notion introduced is what he calls ``a scheme of simplification which is a triplet \((M, \leq, R)\), where \(M\) is a set, ``\(\leq\) is a partial order on \(M\) satisfying descending chain condition and \(R\) is a set of ``simplificators, i.e. some non-increasing mapping from \(M\) to \(M\). (In order to keep in mind a concrete example, consider the case where \(M\) is the set of polynomials \(k[x_1,\dots,x_n]\) -- considered as the \(k\)-linear space generated by monomials -- the partial order~``\(\leq\) is a term-order, \(G\) is a Gröbner basis for the given term-order and the ``simplificator \(R\) is the set of linear automorphisms which send the monomials to their reduced form with respect to \(G\)). In this general setting one can again define the notion of standard bases and obtain some of their characterizations which particularize to the usual ones. The last sections of the paper give some examples in order to show the applicability of the introduced theory. For the entire collection see [Zbl 0941.00013].











This page was built for publication: An improved version of standard bases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502567)