Abstract
We present the canonical Gröbner Cover method for discussing parametric polynomial systems of equations. Its objective is to decompose the parameter space into subsets (segments) for which it exists a generalized reduced Gröbner basis in the whole segment with fixed set of leading power products on it. Wibmer’s Theorem guarantees its existence. The Gröbner Cover is designed in a joint paper of the authors, and the Singular grobcov.lib library [15] implementing it, is developed by Montes. The algorithm is canonic and groups the solutions having the same kind of properties into different disjoint segments. Even if the algorithms involved have high complexity, we show how in practice it is effective in many applications of medium difficulty. An interesting application to automatic deduction of geometric theorems is roughly described here, and another one to provide a taxonomy for exact geometrical loci computations, that is experimentally implemented in a web based application using the dynamic geometry software Geogebra, is explained in another session.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Abanades, M., Botana, F., Montes, A., Recio, T.: An Algebraic Taxonomy for Locus Computation in Dynamic Geometry. Computer Aided Design (submitted, 2014)
Gianni, P., Trager, B., Zacharia, G.: Gröbner Bases and Primary Decomposition of Polynomial Ideals. Jour. Symb. Comp. 6, 149–167 (1988)
Kapur, D., Sun, Y., Wang, D.: A new algorithm for computing comprehensive Gröbner systems. In: Proceedings of ISSAC 2010, pp. 29–36. ACM Press, New York (2010)
Manubens, M., Montes, A.: Minimal canonical comprehensive Gröbner systems. Jour. Symb. Comp. 44(5), 463–478 (2009)
Montes, A.: A new algorithm for discussing Gröbner bases with parameters. Jour. Symb. Comp. 22, 183–208 (2002)
Montes, A.: Using Kapur-Sun-Wang algorithm for the Gröbner Cover. In: Sendra, R., Villarino, C. (eds.) Proceedings of EACA 2012, pp. 135–138. Universidad de Alcalá de Henares (2012)
Montes, A., Recio, T.: Generalizing the Steiner-Lehmus theorem using the Gröbner Cover. Mathematics and Computers in Simulation 104, 67–81 (2014), http://dx.doi.org/10.1016/j.matcom.2013.06.006
Montes, A., Wibmer, M.: Gröbner bases for polynomial systems with parameters. Jour. Symb. Comp. 45, 1391–1425 (2010)
Nabeshima, K.: A speed-up of the algorithm for computing comprehensive Gröbner systems. In: Proceedings of ISSAC 2007, pp. 299–306. ACM Press (2007)
Classical Steiner-Lehmus Theorem (2010), http://www.mathematik.uni-bielefeld.de/silke/PUZZLES/steinerlehmus
Suzuki, A., Sato, Y.: A simple algorithm to compute comprehensive Gröbner bases. In: Proceedings of ISAAC 2006, pp. 326–331. ACM, New York (2006)
Weispfenning, V.: Comprehensive Gröbner bases. Jour. of Symb. Comp. 14, 1–29 (1992)
Weispfenning, V.: “Canonical Comprehensive Gröbner Basis”. Jour. Symb. Comp. 36, 669–683 (2003)
Wibmer, M.: Gröbner bases for families of affine or projective schemes. Jour. Symb. Comp. 42, 803–834 (2007)
Singular, http://www.singular.uni-kl.de/ (last accessed February 2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Montes, A., Wibmer, M. (2014). Software for Discussing Parametric Polynomial Systems: The Gröbner Cover . In: Hong, H., Yap, C. (eds) Mathematical Software – ICMS 2014. ICMS 2014. Lecture Notes in Computer Science, vol 8592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_62
Download citation
DOI: https://doi.org/10.1007/978-3-662-44199-2_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44198-5
Online ISBN: 978-3-662-44199-2
eBook Packages: Computer ScienceComputer Science (R0)