A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimension
Simone Naldi, Vincent Neiger · 2020
Let f1, ..., fm be elements in a quotient Rn/N which has finite dimension as a K-vector space, where R = K[X1, ..., Xr] and N is an R-submodule of Rn. We address the problem of computing a Gröbner basis of the module of syzygies of (f1, ..., fm), that is, of vectors (p1, ..., pm) ∈ Rm such that p1f1 + ... + pm fm = 0.