Abstract
For most applications of Gröbner bases, one needs only a nice Gröbner basis of a given ideal and does not need to specify the monomial ordering. From a nice basis, we mean a basis with small size. For this purpose, Gritzmann and Sturmfels [14] introduced the method of dynamic Gröbner bases computation and also a variant of Buchberger’s algorithm to compute a nice Gröbner basis. Caboara and Perry [6] improved this approach by reducing the size and number of intermediate linear programs. In this paper, we improve the latter approach by proposing an algorithm to compute nicer Gröbner bases. The proposed algorithm has been implemented in Sage and its efficiency is discussed via a set of benchmark polynomials.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The Sage code of the implementations of our algorithms and examples are available at http://amirhashemi.iut.ac.ir/softwares.
References
Becker, T., Weispfenning, V.: Gröbner Bases: A Computational Approach to Commutative Algebra. Springer, New York (1993). In cooperation with Heinz Kredel
Buchberger, B.: A criterion for detecting unnecessary reductions in the construction of Gröbner-bases. In: Ng, E.W. (ed.) EUROSAM 1979. LNCS, vol. 72, pp. 3–21. Springer, Heidelberg (1979)
Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Innsbruck: Univ. Innsbruck, Mathematisches Institut (Diss.) (1965)
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. Translation from the German. J. Symb. Comput. 41(3–4), 475–511 (2006)
Caboara, M.: A dynamic algorithm for Gröbner basis computation. In: Proceedings of International Symposium on Symbolic and Algebraic Computation, ISSAC 1993, pp. 275–283 (1993)
Caboara, M., Perry, J.: Reducing the size and number of linear programs in a dynamic Gröbner basis algorithm. Appl. Algebra Eng. Commun. Comput. 25(1–2), 99–117 (2014)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms. An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3rd edn. Springer, New York (2007)
Faugère, J.C.: A new efficient algorithm for computing Gröbner bases \((F_4)\). J. Pure Appl. Algebra 139(1–3), 61–88 (1999)
Faugère, J.C.: A new efficient algorithm for computing Gröbner bases without reduction to zero \((F_5)\). In: Proceedings of International Symposium on Symbolic and Algebraic Computation, ISSAC 2002, pp. 75–83 (2002)
Fröberg, R.: An Introduction to Gröbner Bases. John Wiley & Sons, Chichester (1997)
Gebauer, R., Möller, H.: On an installation of Buchberger’s algorithm. J. Symb. Comput. 6(2–3), 275–286 (1988)
Giovini, A., Mora, T., Niesi, G., Robbiano, L., Traverso, C.: “One sugar cube, please” or selection strategies in the Buchberger algorithm. In: Proceedings of International Symposium on Symbolic and Algebraic Computation, ISSAC 1991, pp. 49–54 (1991)
Greuel, G.M., Pfister, G.: A singular introduction to commutative algebra. With contributions by Olaf Bachmann, Christoph Lossen and Hans Schönemann, 2nd extended edn. Springer, Berlin (2007)
Gritzmann, P., Sturmfels, B.: Minkowski addition of polytopes: computational complexity and applications to Gröbner bases. SIAM J. Discrete Math. 6(2), 246–269 (1993)
Lazard, D.: Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations. In: van Hulzen, J.A. (ed.) EUROCAL 1983. LNCS, vol. 162, pp. 146–156. Springer, Heidelberg (1983)
Mora, T., Robbiano, L.: The Gröbner fan of an ideal. J. Symb. Comput. 6(2–3), 183–208 (1988)
Robbiano, L.: Term orderings on the polynomial ring. In: Caviness, B.F. (ed.) EUROCAL 1985. LNCS, vol. 204, pp. 513–517. Springer, Heidelberg (1985)
Stein, W.: Sage: Open Source Mathematical Software (Version 7.0). The Sage Group (2016). http://www.sagemath.org
Acknowledgments
The research of the first author was in part supported by a grant from IPM (No. 94550420). The authors are grateful to anonymous referees for their useful and helpful comments on preliminary version of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Hashemi, A., Talaashrafi, D. (2016). A Note on Dynamic Gröbner Bases Computation. In: Gerdt, V., Koepf, W., Seiler, W., Vorozhtsov, E. (eds) Computer Algebra in Scientific Computing. CASC 2016. Lecture Notes in Computer Science(), vol 9890. Springer, Cham. https://doi.org/10.1007/978-3-319-45641-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-319-45641-6_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-45640-9
Online ISBN: 978-3-319-45641-6
eBook Packages: Computer ScienceComputer Science (R0)