Threaded Gröbner Bases: a Macaulay2 package
arXiv:2011.08126 · doi:10.2140/jsag.2021.11.123
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 classical Buchberger's algorithm in {\it Macaulay2}. The output of the main function of the package includes information about {\it 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.
5 pages, package in revision