No label defined (Q4440644)

Dealing with and hopefully exploiting graded structures is an important and much studied topic in computational commutative algebra. In this paper a very general approach is taken for a systematic study. The authors consider \(\Gamma\)-gradings of a polynomial ring or a free module over a polynomial ring with \(\Gamma\) a commutative monoid, typically \({\mathbb Z}^m\). The notion of {(weak) positivity} of a grading is introduced, and it is shown that positively graded modules always have so-called {Macaulay bases}. This is a notion closely related to Gröbner bases. The authors continue by studying homogenization and dehomogenization techniques. Finally, a multihomogeneous version of the Buchberger algorithm is presented. This algorithm has the advantage of computing a Gröbner basis degree by degree. For the entire collection see [Zbl 1024.00025].