Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra (Q2133928)

Signature-based algorithms have become a standard approach for computing Gröbner bases in commutative polynomial rings. The paper under review extends the concept of signature-based algorithm to the setting of noncommutative polynomials in the free algebra. The extended algorithm enumerates a signature Gröbner basis as well as a Gröbner basis of the module generated by the leading terms of the generators' syzygies, and it terminates whenever the ideal admits a finite signature Gröbner basis. Additionally, the paper generalises well-known signature-based criteria (such as the syzygy criterion, the F5 criterion and the singular criterion) and reconstruction methods to the case of noncommutative polynomials. This paper also provides an implementation of all the algorithms in the Mathematica package OperatorGB and compares the signature-based algorithm to the classical Buchberger algorithm for noncommutative polynomials.