Simple signature-based Groebner basis algorithm

2012/05/28 by Vasily Galkin, Galkin, Vasily
Computer Science · Engineering · Mathematics · #Advanced Numerical Analysis Techniques #Commutative Algebra (math.AC) #FOS: Mathematics #Numerical Methods and Algorithms #Polynomial and algebraic computation #math.AC

paper · pdf · doi:10.48550/arxiv.1205.6050

arxiv created 2012/05/28 · openalex publication_date 2012/05/28 · arxiv updated 2012/05/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper presents an algorithm for computing Groebner bases based upon labeled polynomials and ideas from the algorithm F5. The main highlights of this algorithm compared with analogues are simplicity both of the algorithm and of the its correctness proof achieved without loss of the efficiency. This leads to simple implementation which performance is in par with more complex analogues

Cited by

• An analysis of inhomogeneous signature-based Gröbner basis computations

Related

• An efficient reduction strategy for signature-based algorithms to compute Groebner basis
• Practical Groebner Basis Computation
• Signature-based algorithms to compute Groebner bases
• Signature-Based Gröbner Basis Algorithms --- Extended MMM Algorithm for computing Gröbner bases
• A survey on signature-based Gröbner basis computations