Abstract
This is NOT an introductory survey do Gröbner bases and Buchberger algorithms; for that there are a lot of better available papers, even by me. The only aim of this small note is to harmonize the notation and terminology throughout this book.
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
Preview
Unable to display preview. Download preview PDF.
References
D. Bayer and M. Stillman, A theorem on refining division orders by the reverse lexicographic order, Duke Math. J. 55 (1987), nos. 2, 321–328.
M. Brickenstein, Gröbner bases with slim polynomials, Reports in Comp. Alg. 35, Univ. Kaiserslautern, Kaiserslautern, 2005, http://www.mathematik.uni-kl.de/.
B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, Ph.D. thesis, Innsbruck, 1965.
B. Buchberger, Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems, Aequationes Math. 4 (1970), 374–383.
B. Buchberger, A criterion for detecting unnecessary reductions in the construction of Gröbner-bases, Symbolic and algebraic computation (EUROSAM 1979), LNCS, vol. 72, Springer, Berlin, 1979, pp. 3–21.
B. Buchberger, An algorithmical criterion for the solvability of algebraic systems of equations, London Math. Soc. LNS 251 (1998), 535–545.
B. Buchberger, Bruno Buchberger’s PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal, J. Symb. Comput. 41 (2006), nos. 3–4, 475–511.
E. Byrne and T. Mora, Gröbner bases over commutative rings and applications to coding theory, this volume, 2009, pp. 239–261.
M. Caboara and M. Silvestri, Classification of compatible module orderings, J. Pure Appl. Algebra 142 (1999), nos. 1, 13–24.
G. Carrà Ferro and W. Y. Sit, On term-orderings and rankings, Computational algebra (Fairfax, VA, 1993), Lecture Notes in Pure and Appl. Math., vol. 151, Dekker, New York, 1994, pp. 31–77.
J. Erdös, On the structure of ordered real vector spaces, Publ. Math. Debrecen 4 (1956), 334–343.
J. C. Faugére, A new efficient algorithm for computing Gröbner bases (F 4), J. Pure Appl. Algebra 139 (1999), nos. 1–3, 61–88.
J. C. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F 5), Proc. of ISSAC 2002, ACM, New York, 2002, pp. 75–83.
A. Galligo, À propos du théorème de-préparation de Weierstrass, Fonctions de plusieurs variables complexes, Springer, Berlin, 1974, pp. 543–579. LNM. 409.
R. Gebauer and H. M. Möller, A fast variant of Buchberger’s algorithm, preprint, 1985.
R. Gebauer and H. M. Möller, On an installation of Buchberger’s algorithm, J. Symb. Comput. 6 (1988), nos. 2–3, 275–286.
V. P. Gerdt and Y. A. Blinkov, Involutive bases of polynomial ideals, Math. Comput. Simulation 45 (1998a), nos. 5–6, 519–541.
V. P. Gerdt and Y. A. Blinkov, Minimal involutive bases, Math. Comput. Simulation 45 (1998b), nos. 5–6, 543–560.
A. Giovini, T. Mora, G. Niesi, L. Robbiano and C. Traverso, “One Sugar cube, please” or selection strategies in the Buchberger algorithm, Proceedings of ISSAC 1991, ACM, New York, 1991, pp. 49–54.
P. Gordan, Les invariants des formes binaries, Journal de Mathématiques Pure et Appliés 6 (1900), 141–156.
M. Janet, Sur les systèmes d’équations aux dérivées partielles, Journal de Mathématiques Pure et Appliés 3 (1920), 65–151.
F. S. Macaulay, On the resolution of a given modular system into primary systems including some properties of Hilbert numbers, Math. Ann. 74 (1913), no. 1, 66–121.
F. S. Macaulay, The Algebraic Theory of Modular Systems, Cambridge University Press, Cambridge, 1916.
H. M. Möller, On the construction of Gröbner bases using syzygies, J. Symb. Comput. 6 (1988), nos. 2–3, 345–359.
T. Mora, The FGLM problem and Moeller’s algorithm on zero-dimensional ideals, this volume, 2009, pp. 1–100.
C. Traverso and L. Donato, Experimenting the Gröbner basis algorithm with AlPI system, Proc. of ISSAC 1989, ACM, New York 1989, pp. 192–198.
A. Y. Zarkov, Solving zero-dimensional involutive systems, Proc. of MEGA 1994, Birkhäuser, Basel, 1996, pp. 389–399.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Mora, T. (2009). Gröbner Technology. In: Sala, M., Sakata, S., Mora, T., Traverso, C., Perret, L. (eds) Gröbner Bases, Coding, and Cryptography. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-93806-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-540-93806-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-93805-7
Online ISBN: 978-3-540-93806-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)