Abstract
AbstractA relationship between a parametric ideal and its generic Gröbner basis is discussed, and a new stability condition of a Gröbner basis is given. It is shown that the ideal quotient of the parametric ideal by the ideal generated using the generic Gröbner basis provides the stability condition. Further, the stability condition is utilized to compute a comprehensive Gröbner system, and hence as an application, we obtain a new algorithm for computing comprehensive Gröbner systems. The proposed algorithm has been implemented in the computer algebra system Risa/Asir and experimented with a number of examples. Its performance (execution timings) has been compared with the Kapur-Sun-Wang’s algorithm for computing comprehensive Gröbner systems.
Funder
Tokyo University of Science
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Algebra and Number Theory
Reference20 articles.
1. Decker, W. Greuel, G.-M., Pfister, G., Schönemann, H.: Singular 4-1-0 — A computer algebra system for polynomial computations, (2016) http://www.singular.uni-kl.de
2. Fukasaku, R., Inoue, S., Sato, Y.: On QE algorithms over an algebraically closed field based on comprehensive Gröbner systems. Math. Comput. Sci. 9, 267–281 (2015)
3. Fukasaku, R., Iwane, H., Sato, Y.: On multivariate Hermitian quadratic forms. Math. Comput. Sci. 13, 79–93 (2018)
4. Kalkbrener, M.: On the stability of Gröbner bases under specializations. J. Symb. Comp. 24, 51–58 (1997)
5. Kapur, D., Sun, Y., Wang, D. : A new algorithm for computing comprehensive Gröbner systems. Proc. ISSAC 2010, 29–36, ACM, (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献