A New Signature-Based Algorithms for Computing Gr?bner Bases

被引：0
|
作者：
ZHENG Licui [1 ]
LIU Jinwang [2 ]
LIU Weijun [1 ]
LI Dongmei [2 ]
机构：
[1] School of Mathematics and Statistics,Central South University
[2] Department of Mathematics and Computing Sciences,Hunan University of Science and Technology
来源：
JournalofSystemsScience&Complexity | 2015年 / 28卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Factor; Gr?bner basic; signature-based;
D O I：
暂无
中图分类号：
O154.2 [同调代数];
学科分类号：
0701 ; 070101 ;
摘要：
Gao,Volny and Wang(2010) gave a simple criterion for signature-based algorithms to compute Grobner bases.It gives a unified frame work for computing Grobner bases for both ideals and syzygies,the latter is very important in free resolutions in homological algebra.Sun and Wang(2011) later generalized the GVW criterion to a more general situation(to include the F5 Algorithm).Signature-based algorithms have become increasingly popular for computing Grobner bases.The current paper introduces a concept of factor pairs that can be used to detect more useless J-pairs than the generalized GVW criterion,thus improving signature-based algorithms.
引用
收藏
页码：210 / 221
页数：12
相关论文
共 50 条
  • [31] The graph based on Gröbner-Shirshov bases of groups
    Eylem G Karpuz
    Firat Ates
    A Sinan Çevik
    I Naci Cangul
    Fixed Point Theory and Applications, 2013
  • [32] Termination of algorithm for computing relative Gröbner bases and difference differential dimension polynomials
    Guanli Huang
    Meng Zhou
    Frontiers of Mathematics in China, 2015, 10 : 635 - 648
  • [33] Asymmetric approach to computation of Gröbner bases
    Pankratiev E.V.
    Semenov A.S.
    Journal of Mathematical Sciences, 2008, 149 (3) : 1235 - 1245
  • [34] New Difference Gröbner Bases and Bivariate Difference Dimension Polynomials
    Levin, Alexander
    MATHEMATICS IN COMPUTER SCIENCE, 2024, 18 (03)
  • [35] Towards Signature-Based Grobner Basis Algorithms for Computing the Nondegenerate Locus of a Polynomial System
    Eder, Christian
    Lairez, Pierre
    Mohr, Rafael
    El Din, Mohab Safey
    ACM COMMUNICATIONS IN COMPUTER ALGEBRA, 2022, 56 (02): : 41 - 45
  • [36] Truncated Gröbner Bases for Integer Programming
    R. R. Thomas
    R. Weismantel
    Applicable Algebra in Engineering, Communication and Computing, 1997, 8 : 241 - 256
  • [37] On the Relation Between Gröbner and Pommaret Bases
    Daniel Mall
    Applicable Algebra in Engineering, Communication and Computing, 1998, 9 : 117 - 123
  • [38] Gröbner bases and combinatorics for binary codes
    M. Borges-Quintana
    M. A. Borges-Trenard
    P. Fitzpatrick
    E. Martínez-Moro
    Applicable Algebra in Engineering, Communication and Computing, 2008, 19 : 393 - 411
  • [39] Slimgb: Gröbner bases with slim polynomials
    Michael Brickenstein
    Revista Matemática Complutense, 2010, 23 : 453 - 466
  • [40] The λ-Gröbner Bases Under Polynomial Composition
    Jinwang Liu
    Dongmei Li
    Xiaosong Chen
    Journal of Systems Science and Complexity, 2007, 20 : 610 - 613
12345