Modifying Faugère's F5 algorithm to ensure termination

DOI10.1145/2016567.2016574MaRDI QIDQ5175285zbMATH OpenOpenAlexFDO

Authors Christian Eder, Justin Gash, John Perry

Publication date 20 February 2015

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1006.0318

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Abstract: The structure of the F5 algorithm to compute Gr"obner bases makes it very efficient. However, while it is believed to terminate for so-called regular sequences, it is not clear whether it terminates for all inputs. This paper has two major parts. In the first part, we describe in detail the difficulties related to a proof of termination. In the second part, we explore three variants that ensure termination. Two of these have appeared previously only in dissertations, and ensure termination by checking for a Gr"obner basis using traditional criteria. The third variant, F5+, identifies a degree bound using a distinction between "necessary" and "redundant" critical pairs that follows from the analysis in the first part. Experimental evidence suggests this third approach is the most efficient of the three.

Recommendations

• The termination of the F5 algorithm revisited
• Termination of the F5 algorithm
• Proof of the Faugère criterion for the F5 algorithm
• A new proof for the correctness of the F5 algorithm
• The F5 algorithm in Buchberger's style
• A Modified Termination Rule for Karmarkar’s Algorithm
• A modification of krawczyk's algorithm
• Fault tolerant Faddeeva algorithm
• scientific article; zbMATH DE number 5605689
• Five Determinisation Algorithms

Cited in

(9)

• A survey on signature-based algorithms for computing Gröbner bases
• Termination of the F5 algorithm
• A new algorithm for the generation of unitarity-compatible integration by parts relations
• On the complexity of the \(F_5\) Gröbner basis algorithm
• An analysis of inhomogeneous signature-based Gröbner basis computations
• The termination of the F5 algorithm revisited
• scientific article; zbMATH DE number 5831023 (Why is no real title available?)
• A new proof for the correctness of the F5 algorithm
• Bounded regularity

Describes a project that uses

Uses Software

• Magma
• SINGULAR
• F5C
• PolyBoRi
• MXL3

This page was built for publication: Modifying Faugère's F5 algorithm to ensure termination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5175285)