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

by   Clemens Hofstadler, et al.

Signature-based algorithms have become a standard approach for computing Gröbner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free algebra. In this paper, we present a signature-based algorithm for computing Gröbner bases in precisely this setting. The algorithm is an adaptation of Buchberger's algorithm including signatures. We prove that our algorithm correctly 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 that it terminates whenever the ideal admits a finite signature Gröbner basis. Additionally, we adapt well-known signature-based criteria eliminating redundant reductions, such as the syzygy criterion, the F5 criterion and the singular criterion, to the case of noncommutative polynomials. We also generalize reconstruction methods from the commutative setting that allow to recover, from partial information about signatures, the coordinates of elements of a Gröbner basis in terms of the input polynomials, as well as a basis of the syzygy module of the generators. We have written a toy implementation of all the algorithms in the Mathematica package OperatorGB and we compare our signature-based algorithm to the classical Buchberger algorithm for noncommutative polynomials.


page 1

page 2

page 3

page 4


Signature-based Criteria for Möller's Algorithm for Computing Gröbner Bases over Principal Ideal Domains

Signature-based algorithms have become a standard approach for Gröbner b...

Signature Gröbner bases in free algebras over rings

We generalize signature Gröbner bases, previously studied in the free al...

On Polynomial Ideals And Overconvergence In Tate Algebras

In this paper, we study ideals spanned by polynomials or overconvergent ...

An efficient reduction strategy for signature-based algorithms to compute Groebner basis

This paper introduces a strategy for signature-based algorithms to compu...

A Generic and Executable Formalization of Signature-Based Gröbner Basis Algorithms

We present a generic and executable formalization of signature-based alg...

Modular Techniques For Noncommutative Gröbner Bases

In this note, we extend modular techniques for computing Gröbner bases f...

On Two Signature Variants Of Buchberger's Algorithm Over Principal Ideal Domains

Signature-based algorithms have brought large improvements in the perfor...

Please sign up or login with your details

Forgot password? Click here to reset