A Survey on Algorithms for Computing Comprehensive Grobner Systems and Comprehensive Grobner Bases

被引：4
|
作者：
Lu Dong [1 ,2 ]
Sun Yao [3 ]
Wang Dingkang [1 ,2 ]
机构：
[1] Chinese Acad Sci, Acad Math & Syst Sci, KLMM, Beijing 100190, Peoples R China
[2] Univ Chinese Acad Sci, Sch Math Sci, Beijing 100049, Peoples R China
[3] Chinese Acad Sci, Inst Informat Engn, SKLOIS, Beijing 100093, Peoples R China
来源：
JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY | 2019年 / 32卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Comprehensive Grobner basis; comprehensive Grobner system; discovering geometric theorems mechanically; parametric polynomial system; quantifier elimination;
D O I：
10.1007/s11424-019-8357-z
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Weispfenning in 1992 introduced the concepts of comprehensive Grobner system/basis of a parametric polynomial system, and he also presented an algorithm to compute them. Since then, this research field has attracted much attention over the past several decades, and many efficient algorithms have been proposed. Moreover, these algorithms have been applied to many different fields, such as parametric polynomial equations solving, geometric theorem proving and discovering, quantifier elimination, and so on. This survey brings together the works published between 1992 and 2018, and we hope that this survey is valuable for this research area.
引用
收藏
页码：234 / 255
页数：22
相关论文
共 50 条
  • [31] Stronger bounds on the cost of computing Grobner bases for HFE systems
    Gorla, Elisa
    Mueller, Daniela
    Petit, Christophe
    JOURNAL OF SYMBOLIC COMPUTATION, 2022, 109 : 386 - 398
  • [32] Bifurcations in Hamiltonian systems - Computing singularities by Grobner bases - Preface
    Broer, H
    Hoveijn, I
    Lunter, G
    Vegter, G
    BIFURCATIONS IN HAMILTONIAN SYSTEMS: COMPUTING SINGULARITIES BY GROBNER BASES, 2003, 1806 : V - +
  • [33] Real Quantifier Elimination by Computation of Comprehensive Grobner Systems
    Fukasaku, Ryoya
    Iwane, Hidenao
    Sato, Yosuke
    PROCEEDINGS OF THE 2015 ACM ON INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC'15), 2015, : 173 - 180
  • [34] Computation of Discrete Comprehensive Grobner Bases Using Modular Dynamic Evaluation
    Kurata, Yosuke
    Noro, Masayuki
    ISSAC 2007: PROCEEDINGS OF THE 2007 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, 2007, : 243 - 250
  • [35] Computing Grobner and Involutive Bases for Linear Systems of Difference Equations
    Yanovich, Denis
    MATHEMATICAL MODELING AND COMPUTATIONAL PHYSICS 2017 (MMCP 2017), 2018, 173
  • [36] ON THE COMPLEXITY OF COMPUTING CRITICAL POINTS WITH GROBNER BASES
    Spaenlehauer, Pierre-Jean
    SIAM JOURNAL ON OPTIMIZATION, 2014, 24 (03) : 1382 - 1401
  • [37] Opal: A system for computing noncommutative Grobner bases
    Green, EL
    Heath, LS
    Keller, BJ
    REWRITING TECHNIQUES AND APPLICATIONS, 1997, 1232 : 331 - 334
  • [38] Computing homology using generalized Grobner bases
    Hall, Becky Eide
    JOURNAL OF SYMBOLIC COMPUTATION, 2013, 54 : 59 - 71
  • [39] Towards a certified and efficient computing of Grobner bases
    Jorge, JS
    Gulías, VM
    Freire, JL
    Sánchez, JJ
    COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2005, 2005, 3643 : 111 - 120
  • [40] An efficient algorithm for computing a comprehensive Grobner system of a parametric polynomial system
    Kapur, Deepak
    Sun, Yao
    Wang, Dingkang
    JOURNAL OF SYMBOLIC COMPUTATION, 2013, 49 : 27 - 44
12345