Signature-based Möller's algorithm for strong Gröbner bases over PIDs

01/28/2019
by   Maria Francis, et al.
0

Signature-based algorithms are the latest and most efficient approach as of today to compute Gröbner bases for polynomial systems over fields. Recently, possible extensions of these techniques to general rings have attracted the attention of several authors. In this paper, we present a signature-based version of Möller's classical variant of Buchberger's algorithm for computing strong Gröbner bases over Principal Ideal Domains (or PIDs). It ensures that the signatures do not decrease during the algorithm, which makes it possible to apply classical signature criteria for further optimization. In particular, with the F5 criterion, the signature version of Möller's algorithm computes a Gröbner basis without reductions to zero for a polynomial system given by a regular sequence. We also show how Buchberger's chain criterion can be implemented so as to be compatible with the signatures. We prove correctness and termination of the algorithm. Furthermore, we have written a toy implementation in Magma, allowing us to quantitatively compare the efficiency of the various criteria for eliminating S-pairs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2018

A Signature-based Algorithm for computing Computing Gröbner Bases over Principal Ideal Domains

Signature-based algorithms have become a standard approach for Gröbner b...
research
02/05/2021

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

Signature-based algorithms have brought large improvements in the perfor...
research
10/25/2022

Axioms for a theory of signature bases

Twenty years after the discovery of the F5 algorithm, Gröbner bases with...
research
02/13/2023

Signature Gröbner bases in free algebras over rings

We generalize signature Gröbner bases, previously studied in the free al...
research
12/03/2020

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

We present a generic and executable formalization of signature-based alg...
research
09/28/2018

Computation of Pommaret Bases Using Syzygies

We investigate the application of syzygies for efficiently computing (fi...
research
02/10/2021

On FGLM Algorithms with Tate Algebras

Tate introduced in [Ta71] the notion of Tate algebras to serve, in the c...

Please sign up or login with your details

Forgot password? Click here to reset