arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1308.2371cs.SC
收藏

基于符号的Gröbner基算法--计算格罗布纳基的扩展MMM算法

Signature-Based Gröbner Basis Algorithms --- Extended MMM Algorithm for computing Gröbner bases

Yao Sun

摘要:

基于签名的算法是计算格罗布纳基的一类常用算法,近年来已有许多相关的论文发表。在本文中,没有新的基于签名的算法和新的证明。相反,基于签名的算法的观点,即基于签名的算法可以被视为著名的MMM算法的扩展版本。通过这种观点,本文旨在提供一种更容易理解基于签名的格罗布纳基算法的方法。

英文摘要:

Signature-based algorithms is a popular kind of algorithms for computing Gröbner bases, and many related papers have been published recently. In this paper, no new signature-based algorithms and no new proofs are presented. Instead, a view of signature-based algorithms is given, that is, signature-based algorithms can be regarded as an extended version of the famous MMM algorithm. By this view, this paper aims to give an easier way to understand signature-based Gröbner basis algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑