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
来源：
Journal of Systems Science & 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 条
  • [1] A new signature-based algorithms for computing Gröbner bases
    Licui Zheng
    Jinwang Liu
    Weijun Liu
    Dongmei Li
    Journal of Systems Science and Complexity, 2015, 28 : 210 - 221
  • [2] A Signature-Based Algorithm for Computing Gröbner Bases over Principal Ideal Domains
    Maria Francis
    Thibaut Verron
    Mathematics in Computer Science, 2020, 14 : 515 - 530
  • [3] Improving incremental signature-based gröbner basis algorithms
    Eder, Christian
    Eder, C. (ederc@mathematik.uni-kl.de), 1600, Association for Computing Machinery, 2 Penn Plaza, Suite 701, New York, NY 10121-0701, United States (47) : 1 - 2
  • [4] A new signature-based algorithms for computing Grobner bases
    Zheng Licui
    Liu Jinwang
    Liu Weijun
    Li Dongmei
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2015, 28 (01) : 210 - 221
  • [5] A Survey on Algorithms for Computing Comprehensive Gr?bner Systems and Comprehensive Gr?bner Bases
    LU Dong
    SUN Yao
    WANG Dingkang
    Journal of Systems Science & Complexity, 2019, 32 (01) : 234 - 255
  • [6] A Survey on Algorithms for Computing Comprehensive Gröbner Systems and Comprehensive Gröbner Bases
    Dong Lu
    Yao Sun
    Dingkang Wang
    Journal of Systems Science and Complexity, 2019, 32 : 234 - 255
  • [7] A survey on signature-based algorithms for computing Grobner bases
    Eder, Christian
    Faugere, Jean-Charles
    JOURNAL OF SYMBOLIC COMPUTATION, 2017, 80 : 719 - 784
  • [8] Compact representation of polynomials for algorithms for computing Gröbner and involutive bases
    D. A. Yanovich
    Programming and Computer Software, 2015, 41 : 126 - 130
  • [9] Signature-based Algorithms to Compute Grobner Bases
    Eder, Christian
    Perry, John
    ISSAC 2011: PROCEEDINGS OF THE 36TH INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2011, : 99 - 106
  • [10] Algorithms for computing Gr o<spacing diaeresis>bner bases of ideal interpolation
    Jiang, Xue
    Gong, Yihe
    AIMS MATHEMATICS, 2024, 9 (07): : 19459 - 19472
12345