On the computation of generalized standard bases (Q914763)

In this paper in the context of graded structures, there are given algorithms to compute generalized standard bases of a given module and of the associated modules of syzygies, generalizing known results and applying them to some computational problems. The graded structures are defined by Buchberger (1965) and Robbiano (1986) which generalize objects as polynomial ring or as graded ring with respect to the usual degree or with respect to the monomial decomposition, and the tangent cone to an algebraic variety. The concept of reduction procedure in a graded structure, which is relevant from the computational point of view, is presented and there are generalized some results of Buchberger (1965, 1985), Moeller (1986) and Mora and Moeller (1986), concerning the polynomial case. An algorithm for computing generalized standard bases is described and based on it is given an if-and-only-if condition for being a generalized standard base. On Gröbner bases, which were introduced by Buchberger (1965) and Mora and Moeller (1986), is defined a suitable graded structure and it is shown that this algorithm may compute also the module of syzygies. The study of quotients of graded structures is presented with applications of Gröbner bases for quotients of ideals of polynomial rings. Some results as given by Lazard (1983), to find \({\mathfrak M}\)-standard bases (\({\mathfrak M}\) is the maximal ideal generated by all variables) by the computation of a Gröbner base of a suitable ideal, are extended to graded structures.