Abstract
We next examine the problem of finding the common roots of a finite set of polynomials over a field K. To do this, we first introduce some necessary algebraic structures. Gröbner bases play a key role in the computational aspect of this problem.
In Chapter 10 we will see how to computationally solve arbitrary systems of polynomial equations using Gröbner bases.
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
Adams, W.W., Loustaunau, P.: An Introduction to Gröbner Bases. Graduate Studies in Mathematics, vol. 3. American Mathematical Society, Providence (1994)
Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry, 2nd edn. Algorithms and Computation in Mathematics, vol. 10. Springer, Berlin (2006)
Becker, T., Weispfenning, V.: Gröbner Bases. Graduate Texts in Mathematics, vol. 141. Springer, New York (1993)
Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. PhD thesis, Universität Innsbruck (1965)
Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Automata Theory and Formal Languages, Second GI Conf., Kaiserslautern, 1975. Lecture Notes in Comput. Sci., vol. 33, pp. 134–183. Springer, Berlin (1975)
Cox, D., Little, J., O’Shea, D.: Ideals, Varieties, and Algorithms, 3rd edn. Undergraduate Texts in Mathematics. Springer, New York (2007)
Cox, D.A., Little, J., O’Shea, D.: Using Algebraic Geometry, 2nd edn. Graduate Texts in Mathematics, vol. 185. Springer, New York (2005)
Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35, 413–422 (1913)
Gordan, P.: Neuer Beweis des Hilbert’schen Satzes über homogene Functionen. Nachr. Königl. Ges. Wiss. Gött. 3, 240–242 (1899)
Hironaka, H.: Resolution of singularities of an algebraic variety over a field of characteristic zero. I. Ann. Math. (2) 79, 109–203 (1964)
Hironaka, H.: Resolution of singularities of an algebraic variety over a field of characteristic zero. II. Ann. Math. (2) 79, 205–326 (1964)
Hong, H., Brown, C.W., et al.: QEPCAD b 1.46. Technical report, RISC Linz and U.S. Naval Academy, Annapolis (2007). http://www.cs.usna.edu/~qepcad/B/QEPCAD.html
Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46(3), 305–329 (1982)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, Cambridge (2003)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Joswig, M., Theobald, T. (2013). Gröbner Bases and Buchberger’s Algorithm. In: Polyhedral and Algebraic Methods in Computational Geometry. Universitext. Springer, London. https://doi.org/10.1007/978-1-4471-4817-3_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4817-3_9
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4816-6
Online ISBN: 978-1-4471-4817-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)