scientific article; zbMATH DE number 2019947
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].
- Multiplication rings and graded rings
- Multiplicity computation of graded modules
- Basic algorithms for manipulation of modules over finite chain rings
- scientific article; zbMATH DE number 1537897
- scientific article; zbMATH DE number 589384
- Some applications of graded ring theory
- Multiplicity bounds in graded rings
- Some constructions over graded rings: Applications
- scientific article; zbMATH DE number 724838
- scientific article; zbMATH DE number 3873461
- ExteriorModules: a package for computing monomial modules over an exterior algebra
- Computing quasidegrees of A-graded modules
- Multiplicity computation of graded modules
- Homogenity, pseudo-homogenity, and Gröbner basis computations
- scientific article; zbMATH DE number 1254277 (Why is no real title available?)
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440644)
