On the construction of Gröbner bases using syzygies (Q909718): Difference between revisions

The classical Buchberger algorithm is based on S-polynomials being reducible to zero. Each S-polynomial depends on exactly two polynomials of F. Whereas the classical theory was developed for multivariate polynomials over fields, some authors generalized it to polynomials over rings, especially for reduction rings, Euclidean rings and principal ideal rings. Gröbner bases were introduced for commutative Noetherian rings. By using syzygies, S-polynomials where interpreted anew. Reduction had to be interpreted again to what the authors call weak reduction. In this paper the systematic use of syzygies in the Gröbner basis construction starting with arbitrary commutative rings is shown. For commutative Noetherian rings, equivalent conditions for weak Gröbner bases are given. For unique factorisation rings R, the author shows that Buchberger's algorithm works with S-polynomials that depend on exactly two polynomials for arbitrary finite sets of input polynomials iff R is a principal ideal ring, thus showing that one only needs to define strong Gröbner bases in rings \(R[X_ 1,...,X_ n]\) with R PIR. Strategies to control the size of the basis of the syzygy modules are presented. The author emphasizes the role of syzygies and not of uniqueness of special Gröbner bases.