Christian Eder — Page 2

arXiv2010

The Algorithmic Behaviour of the F5 Algorithm

This paper has been withdrawn due to an error in the proof of the termination of the algorithm. Moreover, some ideas of this paper are a joint work with John Perry and it is inappropriate to mention only me as an author. John Perry was in spite of the statement in the acknowledgment of previous versions not proofreading this paper. Recently we have found a new solution for ensuring F5's termination, which can be found here : arXiv:1006.0318.

math.AC↗

arXiv2008

On The Criteria Of The F5 Algorithm

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.

math.AC↗