Threaded Gröbner Bases: a Macaulay2 package

11/16/2020

∙

by   Sonja Petrović, et al.

∙

0

∙

share

The complexity of Gröbner computations has inspired many improvements to Buchberger's algorithm over the years. Looking for further insights into the algorithm's performance, we offer a threaded implementation of classical Buchberger's algorithm in Macaulay2. The output of the main function of the package includes information about lineages of non-zero remainders that are added to the basis during the computation. This information can be used for further algorithm improvements and optimization.