A survey on signature-based Gröbner basis computations
arXiv:1404.1774
Abstract
This paper is a survey on the area of signature-based Gröbner basis algorithms that was initiated by Faugère's F5 algorithm in 2002. We explain the general ideas behind the usage of signatures. We show how to classify the various known variants by 3 different orderings. For this we give translations between different notations and show that besides notations many approaches are just the same. Moreover, we give a general description of how the idea of signatures is quite natural when performing the reduction process using linear algebra. This survey shall help to outline this field of active research.
53 pages, 8 figures, 11 tables
References in corpus (6)
- A Generalized Criterion for Signature Related Gröbner Basis Algorithms
- A new conception for computing gröbner basis and its applications
- On The Criteria Of The F5 Algorithm
- Termination of Original F5
- The Termination of Algorithms for Computing Gröbner Bases
- Simple signature-based Groebner basis algorithm