Computing syzygies of homogeneous polynomials using linear algebra
Hodges, Tim, Bates, Dan, Peterson, Chris, Böhm, A. P. Willem · Digital Collections of Colorado (Colorado State University) · 2007
Given a ideal generated by polynomials ƒ1,...,ƒn in polynomial ring of m variables a syzygy is an n-tuple α1,.., αn, & αi in our polynomial ring of m variables such that our n-tuple holds the orthogonal property on the generators above. Syzygies can be computed by Buchberger's algorithm for computing Gröbner Bases. However, Gröbner bases have been computationally impractical as the number of variables and number of polynomials increase. The aim of this thesis is to describe a way to compute syzygies without the need for Grobner bases but still retrieve some of the same information as Gröbner bases. The approach is to use the monomial structure of the polynomials in our generating set to build syzygies using Nullspace computations.