arXiv · 2011.08126
Threaded Gr\"{o}bner Bases: a Macaulay2 package
Abstract
The complexity of Gr\"{o}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.
Explore related subjects
Keep this discovery
Sonja Petrović, Shahrzad Jamshidi Zelenberg. 2020-11-16. Threaded Gr\"{o}bner Bases: a Macaulay2 package. https://doi.org/10.2140/jsag.2021.11.123
Cite the original work for its findings. Save a collection to share your selection of sources.