Abstract

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 the classical Buchberger algorithm in Macaulay2. The output of the main function of the package includes information about lineages of nonzero remainders that are added to the basis during the computation. This information can be used for further algorithm improvements and optimization.

Keywords

Mathematical Subject Classification

Supplementary material

Computing a Groebner basis using the classical Buchberger with multiple threads

Milestones

Authors