A very carefully crafted introduction to the theory and some of the applications of Grobner bases ... contains a wealth of illustrative examples and a wide variety of useful exercises, the discussion is everywhere well-motivated, and further developments and important issues are well sign-posted ... has many solid virtues and is an ideal text for beginners in the subject ... certainly an excellent text. --Bulletin of the London Mathematical Society As the primary tool for doing explicit computations in polynomial rings in many variables, Grobner bases are an important component of all computer algebra systems. They are also important in computational commutative algebra and algebraic geometry. This book provides a leisurely and fairly comprehensive introduction to Grobner bases and their applications. Adams and Loustaunau cover the following topics: the theory and construction of Grobner bases for polynomials with coefficients in a field, applications of Grobner bases to computational problems involving rings of polynomials in many variables, a method for computing syzygy modules and Grobner bases in modules, and the theory of Grobner bases for polynomials with coefficients in rings. With over 120 worked-out examples and 200 exercises, this book is aimed at advanced undergraduate and graduate students. It would be suitable as a supplement to a course in commutative algebra or as a textbook for a course in computer algebra or computational commutative algebra. This book would also be appropriate for students of computer science and engineering who have some acquaintance with modern algebra.

Grobner-Basen werden von Mathematikern und Informatikern zunehmend fur eine breite Palette von Anwendungen genutzt, in denen die algorithmische algebraische Geometrie eine Rolle spielt. Hier werden Grobner-Basen von einem konstruktiven, wenig abstrakten Standpunkt aus behandelt, wobei nur geringe Vorkenntnisse in linearer Algebra und komplexen Zahlen vorausgesetzt werden; zahlreiche Beispiele helfen bei der Durchdringung des Stoffes. Mit einer Ubersicht uber aktuell erhaltliche relevante Softwarepakete.

A very carefully crafted introduction to the theory and some of the applications of Gröbner bases … contains a wealth of illustrative examples and a wide variety of useful exercises, the discussion is everywhere well-motivated, and further developments and important issues are well sign-posted … has many solid virtues and is an ideal text for beginners in the subject … certainly an excellent text. —Bulletin of the London Mathematical Society As the primary tool for doing explicit computations in polynomial rings in many variables, Gröbner bases are an important component of all computer algebra systems. They are also important in computational commutative algebra and algebraic geometry. This book provides a leisurely and fairly comprehensive introduction to Gröbner bases and their applications. Adams and Loustaunau cover the following topics: the theory and construction of Gröbner bases for polynomials with coefficients in a field, applications of Gröbner bases to computational problems involving rings of polynomials in many variables, a method for computing syzygy modules and Gröbner bases in modules, and the theory of Gröbner bases for polynomials with coefficients in rings. With over 120 worked-out examples and 200 exercises, this book is aimed at advanced undergraduate and graduate students. It would be suitable as a supplement to a course in commutative algebra or as a textbook for a course in computer algebra or computational commutative algebra. This book would also be appropriate for students of computer science and engineering who have some acquaintance with modern algebra.

Comprehensive account of theory and applications of Gröbner bases, co-edited by the subject's inventor.

Coding theory and cryptography allow secure and reliable data transmission, which is at the heart of modern communication. Nowadays, it is hard to find an electronic device without some code inside. Gröbner bases have emerged as the main tool in computational algebra, permitting numerous applications, both in theoretical contexts and in practical situations. This book is the first book ever giving a comprehensive overview on the application of commutative algebra to coding theory and cryptography. For example, all important properties of algebraic/geometric coding systems (including encoding, construction, decoding, list decoding) are individually analysed, reporting all significant approaches appeared in the literature. Also, stream ciphers, PK cryptography, symmetric cryptography and Polly Cracker systems deserve each a separate chapter, where all the relevant literature is reported and compared. While many short notes hint at new exciting directions, the reader will find that all chapters fit nicely within a unified notation.

The idea of the Gröbner basis first appeared in a 1927 paper by F. S. Macaulay, who succeeded in creating a combinatorial characterization of the Hilbert functions of homogeneous ideals of the polynomial ring. Later, the modern definition of the Gröbner basis was independently introduced by Heisuke Hironaka in 1964 and Bruno Buchberger in 1965. However, after the discovery of the notion of the Gröbner basis by Hironaka and Buchberger, it was not actively pursued for 20 years. A breakthrough was made in the mid-1980s by David Bayer and Michael Stillman, who created the Macaulay computer algebra system with the help of the Gröbner basis. Since then, rapid development on the Gröbner basis has been achieved by many researchers, including Bernd Sturmfels. This book serves as a standard bible of the Gröbner basis, for which the harmony of theory, application, and computation are indispensable. It provides all the fundamentals for graduate students to learn the ABC’s of the Gröbner basis, requiring no special knowledge to understand those basic points. Starting from the introductory performance of the Gröbner basis (Chapter 1), a trip around mathematical software follows (Chapter 2). Then comes a deep discussion of how to compute the Gröbner basis (Chapter 3). These three chapters may be regarded as the first act of a mathematical play. The second act opens with topics on algebraic statistics (Chapter 4), a fascinating research area where the Gröbner basis of a toric ideal is a fundamental tool of the Markov chain Monte Carlo method. Moreover, the Gröbner basis of a toric ideal has had a great influence on the study of convex polytopes (Chapter 5). In addition, the Gröbner basis of the ring of differential operators gives effective algorithms on holonomic functions (Chapter 6). The third act (Chapter 7) is a collection of concrete examples and problems for Chapters 4, 5 and 6 emphasizing computation by using various software systems.

This self-contained monograph is the first to feature the intersection of the structure theory of noncommutative associative algebras and the algorithmic aspect of Groebner basis theory. A double filtered-graded transfer of data in using noncommutative Groebner bases leads to effective exploitation of the solutions to several structural-computational problems, e.g., an algorithmic recognition of quadric solvable polynomial algebras, computation of GK-dimension and multiplicity for modules, and elimination of variables in noncommutative setting. All topics included deal with algebras of (q-)differential operators as well as some other operator algebras, enveloping algebras of Lie algebras, typical quantum algebras, and many of their deformations.

This volume contains survey and original articles presenting the state of the art on the application of Gröbner bases in control theory and signal processing. The contributions are based on talks delivered at the Special Semester on Gröbner Bases and Related Methods at the Johann Radon Institute of Computational and Applied Mathematics (RICAM), Linz, Austria, in May 2006.

There exist very few concepts in computational algebra which are as central to theory and applications as Grobner bases. This thesis describes theory, algorithms and applications for the special case of Boolean polynomials. These parts form the mathematical foundations of the PolyBoRi framework (developed by the author together with Alexander Dreyer). The PolyBoRi framework has applications spread over a large number of domains ranging from formal verification, computational biology to cryptanalysis and many more. It is emerged to a worldwide audience by the Sage computational algebra system.

1. Preliminaries. 1.1. Presenting algebras by relations. 1.2. S-graded algebras and modules. 1.3. [symbol]-filtered algebras and modules -- 2. The [symbol]-leading homogeneous algebra A[symbol]. 2.1. Recognizing A via G[symbol](A): part 1. 2.2. Recognizing A via G[symbol](A): part 2. 2.3. The [symbol-graded isomorphism A[symbol](A). 2.4. Recognizing A via A[symbol] -- 3. Grobner bases: conception and construction. 3.1. Monomial ordering and admissible system. 3.2. Division algorithm and Grobner basis. 3.3. Grobner bases and normal elements. 3.4. Grobner bases w.r.t. skew multiplicative K-bases. 3.5. Grobner bases in K[symbol] and KQ. 3.6. (De)homogenized Grobner bases. 3.7. dh-closed homogeneous Grobner bases -- 4. Grobner basis theory meets PBW theory. 4.1. [symbol]-standard basis [symbol]-PBW isomorphism. 4.2. Realizing [symbol]-PBW isomorphism by Grobner basis. 4.3. Classical PBW K-bases vs Grobner bases. 4.4. Solvable polynomial algebras revisited -- 5. Using A[symbol] in terms of Grobner bases. 5.1. The working strategy. 5.2. Ufnarovski graph. 5.3. Determination of Gelfand-Kirillov Dimension. 5.4. Recognizing Noetherianity. 5.5. Recognizing (semi- )primeness and PI-property. 5.6. Anick's resolution over monomial algebras. 5.7. Recognizing finiteness of global dimension. 5.8. Determination of Hilbert series -- 6. Recognizing (non- )homogeneous p-Koszulity via A[symbol]. 6.1. (Non- )homogeneous p-Koszul algebras. 6.2. Anick's resolution and homogeneous p-Koszulity. 6.3. Working in terms of Grobner bases -- 7. A study of Rees algebra by Grobner bases. 7.1. Defining [symbol] by [symbol]. 7.2. Defining [symbol] by [symbol]. 7.3. Recognizing structural properties of [symbol] via [symbol]. 7.4. An application to regular central extensions. 7.5. Algebras defined by dh-closed homogeneous Grobner bases -- 8. Looking for more Grobner bases. 8.1. Lifting (finite) Grobner bases from O[symbol]. 8.2. Lifting (finite) Grobner bases from a class of algebras. 8.3. New examples of Grobner basis theory. 8.4. Skew 2-nomial algebras. 8.5. Almost skew 2-nomial algebras