预测Gröbner基计算中的零约化
Predicting zero reductions in Gröbner basis computations
摘要:
自1965年Buchberger的计算Gröbner基地的初始算法以来,已经采取了许多尝试来提前检测零减少。Buchberger的产品和链标准可能是最为人所知的,特别是在Gebauer和Möller的装置中。一个相对较新的方法是基于签名的标准,它在2002年首次用于Faugère的F5算法。对于规则输入序列,这些标准已知根本不计算零约简。本文详细讨论了零约化及相应的合偶。我们解释了如何不同的方法来预测它们相互比较,并显示在理论和实践中的优点和缺点。有了这个新的洞察代数结构的基础Gröbner基地和他们的计算可能会实现。
英文摘要:
Since Buchberger's initial algorithm for computing Gröbner bases in 1965 many attempts have been taken to detect zero reductions in advance. Buchberger's Product and Chain criteria may be known the most, especially in the installaton of Gebauer and Möller. A relatively new approach are signature-based criteria which were first used in Faugère's F5 algorithm in 2002. For regular input sequences these criteria are known to compute no zero reduction at all. In this paper we give a detailed discussion on zero reductions and the corresponding syzygies. We explain how the different methods to predict them compare to each other and show advantages and drawbacks in theory and practice. With this a new insight into algebraic structures underlying Gröbner bases and their computations might be achieved.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。