Abstract
From now on we will develop the study of parametric polynomial systems of equations. In this chapter, after a brief introduction describing the progress in area, we will center our attention on Comprehensive Gröbner Systems (CGS) and Basis (CGB). Computing a Comprehensive Gröbner System is a necessary previous step for obtaining the complete canonical discussion provided by the Gröbner Cover, which is described in Chap. 5, after the introduction of I-regular functions in Chap. 4 that are also required.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
D. Cox, J. Little, D. O’Shea, Ideals, Varieties and Algorithms, 3rd ed., Springer, New-York, 1992.
A. Dolzmann, T. Sturm, Redlog: Computer algebra meets computer logic, ACM Sigsam Bulletin 31/2 (1997) 2–9.
M. Kalkbrenner, On the stability of Gröbner bases under specializations, Journal of Symbolic Computation 24 (1997) 51–58.
D. Kapur, Principles and Practices of Constraints Programming, chap. An Approach for Solving Systems of Parametric Polynomial Equations, MIT Press, 1995, pp. 217–244.
D. Kapur, Y. Sun, D. Wang, A new algorithm for computing comprehensive Gröbner systems, in: Proceedings of ISSAC’2010, ACM Press, New York, 2010, pp. 29–36.
M. Manubens, A. Montes, Improving dispgb algorithm using the discriminant ideal, Journal of Symbolic Computation 41 (2006) 1245–1263.
M. Manubens, A. Montes, Minimal canonical comprehensive Gröbner systems, Journal of Symbolic Computation 44 (5) (2009) 463–478.
A. Montes, A new algorithm for discussing Gröbner bases with parameters, Journal of Symbolic Computation 22 (2002) 183–208.
A. Montes, H. Schönemann, Singular “grobcov.lib” library D.2.4, http://www.singular.uni-kl.de, Computer Algebra System for polynomial computations. Center for Computer Algebra, University of Kaiserslautern, free software under the GNU General Public Licence (2017).
A. Montes, M. Wibmer, Gröbner bases for polynomial systems with parameters, Journal of Symbolic Computation 45 (2010) 1391–1425.
K. Nabeshima, A speed-up of the algorithm for computing comprehensive Gröbner systems, in: Proceedings of ISSAC’2007, ACM Press, New York, 2007, pp. 299–306.
M. Rychlik, Complexity and applications of parametric algorithms of computational algebraic geometry, in: R. de la Llave, L. Petzold, J. Lorenz (eds.), Dynamics of Algorithms, vol. 118 of IMA Volumes in Mathematics and its Applications, Springer, 2000, pp. 1–29.
Y. Sato, A. Suzuki, An alternative approach to comprehensive Gröbner bases, Journal of Symbolic Computation 36:3–4 (2003) 649–667.
A. Suzuki, Y. Sato, A simple algorithm to compute comprehensive Gröbner bases, in: Proceedings of ISSAC’2006, ACM, New York, 2006, pp. 326–331.
A. Suzuki, Y. Sato, Implementation of CGS and CGB on Risa/Asir and other computer algebra systems using Suzuki-Sato algorithm, ACM Communications in Computer Algebra 41:3.
V. Weispfenning, Comprehensive Gröbner bases, Journal of Symbolic Computation 14 (1992) 1–29.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Montes, A. (2018). Comprehensive Gröbner Systems and Bases. In: The Gröbner Cover . Algorithms and Computation in Mathematics, vol 27. Springer, Cham. https://doi.org/10.1007/978-3-030-03904-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-03904-2_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-03903-5
Online ISBN: 978-3-030-03904-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)