Abstract
In this paper, we introduce the concept of universal Gröbner basis for a parametric polynomial ideal. In this direction, we present a new algorithm, called UGS, which takes as input a finite set of parametric polynomials and outputs a universal Gröbner system for the ideal generated by input polynomials, by decomposing the space of parameters into a finite set of parametric cells and for each cell associating a finite set of parametric polynomials which is a universal Gröbner basis for the ideal corresponding to that cell. Indeed, for each values of parameters satisfying a condition set, the corresponding polynomial set forms a universal Gröbner basis for the ideal. Our method relies on the parametric variant of the Gröbner basis conversion and also on the PGBMain algorithm due to Kapur et al. to compute parametric Gröbner bases. The proposed UGS algorithm has been implemented in Maple-Sage and its performance is investigated through an example.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Avis, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65(1–3), 21–46 (1996)
Babson, E., Onn, S., Thomas, R.: The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. Adv. Appl. Math. 30, 529–544 (2003)
Buchberger, B.: Bruno Buchberger’s Ph.D thesis 1965: an algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. J. Symb. Comput. 41(3–4), 475–511 (2006). Translation from the German
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
Dehghani Darmian, M., Hashemi, A., Montes, A.: Erratum to “A new algorithm for discussing Gröbner bases with parameters” (J. Symbolic Comput. 33(1–2), 183–208 (2002)). J. Symb. Comput. 46(10), 1187–1188 (2011)
Fukuda, K., Jensen, A., Lauritzen, N., Thomas, R.: The generic Gröbner walk. J. Symb. Comput. 42(3), 298–312 (2007)
Fukuda, K., Jensen, A.N., Thomas, R.R.: Computing Gröbner fans. Math. Comput. 76(260), 2189–2212 (2007)
Hashemi, A., Dehghani Darmian, M., Barkhordar, M.: Gröbner systems conversion. Math. Comput. Sci. 11(1), 61–77 (2017)
Jensen, A.N.: Gfan, a software system for Gröbner fans and tropical varieties. http://home.imf.au.dk/jensen/software/gfan/gfan.html
Jensen, A.N.: Algorithmic aspects of Gröbner fans and tropical varieties. Technical report (2007)
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 (2010)
Montes, A.: A new algorithm for discussing Gröbner bases with parameters. J. Symb. Comput. 33(2), 183–208 (2002)
Mora, T., Robbiano, L.: The Gröbner fan of an ideal. J. Symb. Comput. 6(2–3), 183–208 (1988)
Schwartz, N.: Stability of Gröbner bases. J. Pure Appl. Algebra 53(1–2), 171–186 (1988)
Stein, W.: Sage: An open source mathematical software (version 7.0). The sage group (2016). http://www.sagemath.org
Sturmfels, B.: Gröbner Bases and Convex Polytopes. AMS, American Mathematical Society, Providece (1996)
Suzuki, A., Sato, Y.: A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases. In: Proceedings of ISSAC 2006, pp. 326–331. ACM Press (2006)
Weispfenning, V.: Constructing universal Gröbner bases. In: Huguet, L., Poli, A. (eds.) AAECC 1987. LNCS, vol. 356, pp. 408–417. Springer, Heidelberg (1989). https://doi.org/10.1007/3-540-51082-6_96
Weispfenning, V.: Comprehensive Gröbner bases. J. Symb. Comput. 14(1), 1–29 (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Hashemi, A., Darmian, M.D., Barkhordar, M. (2018). Universal Gröbner Basis for Parametric Polynomial Ideals. In: Davenport, J., Kauers, M., Labahn, G., Urban, J. (eds) Mathematical Software – ICMS 2018. ICMS 2018. Lecture Notes in Computer Science(), vol 10931. Springer, Cham. https://doi.org/10.1007/978-3-319-96418-8_23
Download citation
DOI: https://doi.org/10.1007/978-3-319-96418-8_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-96417-1
Online ISBN: 978-3-319-96418-8
eBook Packages: Computer ScienceComputer Science (R0)