Modifying Faugère's F5 Algorithm to ensure termination

Details Modifying Faugère's F5 Algorithm to ensure termination Modifying Faugère's F5 Algorithm to ensure termination

2010-06-02

arxiv.org/abs/1006.0318v4

ACM Communications in Computer Algebra, Issue 176, vol. 45, no. 2 (June 2011), pgs. 70-89

Mathematics

Commutative Algebra

19 pages, 1 table

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Modifying Faugère's F5 Algorithm to ensure termination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Modifying Faugère's F5 Algorithm to ensure termination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modifying Faugère's F5 Algorithm to ensure termination will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-512633