A new framework for computing Gröbner bases
A new framework for computing Gröbner bases
复制标题
DOI：
10.1090/mcom/2969
复制
发表时间：
2015-05
期刊：
影响因子：
--
通讯作者：
Shuhong Gao;Frank Volny;Mingsheng Wang
中科院分区：
文献类型：
--
作者：
Shuhong Gao;Frank Volny;Mingsheng Wang
This paper presents a new framework for computing Gröbner bases for ideals and syzygy modules. It is proposed to work in a module that accommodates any given ideal and the corresponding syzygy module (for the given generators of the ideal). A strong Gröbner basis for this module contains Gröbner bases for both the ideal and the syzygy module. The main result is a simple characterization of strong Gröbner bases. This characterization can detect useless S-polynomials without reductions, thus yields an efficient algorithm. It also explains all the rewritten rules used in F5 and the recent papers in the literature. Rigorous proofs are given for the correctness and finite termination of the algorithm. For any term order for an ideal, one may vary signature orders (ie the term orders for the syzygy module). It is shown by computer experiments on benchmark examples that signature orders based on weighted terms are much better than other signature orders. This is useful for practical computation. Also, since computing Göbner bases for syzygies is a main computational task for free resolutions in commutative algebra, the algorithm of this paper should be useful for computing free resolutions in practice. References
