On The Criteria Of The F5 Algorithm
Commutative Algebra
2008-12-03 v4
Abstract
Faugere's F5 algorithm is one of the fastest known algorithms for the computation of Grobner bases. So far only the F5 Criterion is proved, whereas the second powerful criterion, the Rewritten Criterion, is not understood very well until now. We give a proof of both, the F5 Criterion and the Rewritten Criterion showing their connection to syzygies, i.e. the relations between the S-Polynomials to be investigated by the algorithm. Using the example of a Grobner basis computation stated in Faugere's F5 paper we show how the criteria work, and discuss the possibility of improving the F5 Criterion. An introduction to a SINGULAR implementation of F5 is given in the end.
Keywords
Cite
@article{arxiv.0804.2033,
title = {On The Criteria Of The F5 Algorithm},
author = {Christian Eder},
journal= {arXiv preprint arXiv:0804.2033},
year = {2008}
}
Comments
1 new citation, new introduction, appendix about SINGULAR implementation