{"title":"Extending the GVW Algorithm to Local Ring","authors":"Dong Lu, Dingkang Wang, Fanghui Xiao, Jie Zhou","doi":"10.1145/3208976.3208979","DOIUrl":null,"url":null,"abstract":"A new algorithm, which combines the GVW algorithm with the Mora normal form algorithm, is presented to compute the standard bases of ideals in a local ring. Since term orders in local ring are not well-orderings, there may not be a minimal signature in an infinite set, and we can not extend the GVW algorithm from a polynomial ring to a local ring directly. Nevertheless, when given an anti-graded order in R and a term-over-position order in Rm that are compatible, we can construct a special set such that it has a minimal signature, where R , Rm are a local ring and a R -module, respectively. That is, for any given polynomial v0 ın R, the set consisting of signatures of pairs (u,v)ın Rm x R has a minimal element, where the leading power products of v and v0 are equal. In this case, we prove a cover theorem in R , and use three criteria (syzygy criterion, signature criterion and rewrite criterion) to discard useless J-pairs without any reductions. Mora normal form algorithm is also extended to do regular top-reductions in Rm x R, and the correctness and termination of the algorithm are proved. The proposed algorithm has been implemented in the computer algebra system Maple, and experiment results show that most of J-pairs can be discarded by three criteria in the examples.","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3208976.3208979","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
A new algorithm, which combines the GVW algorithm with the Mora normal form algorithm, is presented to compute the standard bases of ideals in a local ring. Since term orders in local ring are not well-orderings, there may not be a minimal signature in an infinite set, and we can not extend the GVW algorithm from a polynomial ring to a local ring directly. Nevertheless, when given an anti-graded order in R and a term-over-position order in Rm that are compatible, we can construct a special set such that it has a minimal signature, where R , Rm are a local ring and a R -module, respectively. That is, for any given polynomial v0 ın R, the set consisting of signatures of pairs (u,v)ın Rm x R has a minimal element, where the leading power products of v and v0 are equal. In this case, we prove a cover theorem in R , and use three criteria (syzygy criterion, signature criterion and rewrite criterion) to discard useless J-pairs without any reductions. Mora normal form algorithm is also extended to do regular top-reductions in Rm x R, and the correctness and termination of the algorithm are proved. The proposed algorithm has been implemented in the computer algebra system Maple, and experiment results show that most of J-pairs can be discarded by three criteria in the examples.
将GVW算法与Mora范式算法相结合,提出了一种计算局部环理想标准基的新算法。由于局部环中的项序不是良序的,因此在无限集中可能不存在最小签名,因此我们不能将GVW算法从多项式环直接推广到局部环。然而,当给定R中的反梯度阶和Rm中的项过位阶相容时,我们可以构造一个具有最小签名的特殊集合,其中R、Rm分别为局部环和R -模。也就是说,对于任何给定的多项式v0 ın R,由(u,v)ın Rm x R对的签名组成的集合有一个最小元素,其中v和v0的前导幂积相等。在这种情况下,我们在R中证明了一个覆盖定理,并使用三个准则(syzygy准则、signature准则和重写准则)在没有任何约简的情况下丢弃无用的j对。将Mora范式算法推广到Rm x R的正则上约,证明了该算法的正确性和终止性。该算法已在计算机代数系统Maple中实现,实验结果表明,在实例中,根据三个准则可以丢弃大多数j对。