Vol. 11, No. 1, 2021

Download this article
Download this article For screen
For printing
Recent Issues
Volume 14, Issue 1
Volume 13, Issue 1
Volume 12, Issue 1
Volume 11, Issue 1
Volume 10, Issue 1
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 1
Volume 7, Issue 1
Volume 6, Issue 1
Volume 5, Issue 1
Volume 4, Issue 1
Volume 3, Issue 1
Volume 2, Issue 1
Volume 1, Issue 1
The Journal
About the Journal
Editorial Board
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
ISSN: 1948-7916
Author Index
To Appear
Other MSP Journals
Threaded Gröbner bases: a Macaulay2 package

Sonja Petrović and Shahrzad Zelenberg

Vol. 11 (2021), 123–127

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.

Gröbner basis, distributed computation, lineages, S-pairs
Mathematical Subject Classification
Primary: 13P10
Supplementary material

Computing a Groebner basis using the classical Buchberger with multiple threads

Received: 19 July 2020
Revised: 6 August 2021
Accepted: 8 October 2021
Published: 20 February 2022
Sonja Petrović
Department of Applied Mathematics
Illinois Institute of Technology
Chicago, IL
United States
Shahrzad Zelenberg
Lake Forest College
Department of Mathematics and Computer Science
Lake Forest, IL
United States