Solving Polynomial Equation Systems IV: Volume 4, Buchberger Theory and Beyond (Encyclopedia of Mathematics and its Applications)

In this fourth and final volume the author extends Buchberger's Algorithm in three different directions. First, he extends the theory to group rings and other Ore-like extensions, and provides an operative scheme that allows one to set a Buchberger theory over any effective associative ring. Second, he covers similar extensions as tools for discussing parametric polynomial systems, the notion of SAGBI-bases, Gröbner bases over invariant rings and Hironaka's theory. Finally, Mora shows how Hilbert's followers - notably Janet, Gunther and Macaulay - anticipated Buchberger's ideas and discusses the most promising recent alternatives by Gerdt (involutive bases) and Faugère (F4 and F5). This comprehensive treatment in four volumes is a significant contribution to algorithmic commutative algebra that will be essential reading for algebraists and algebraic geometers. "The second volume of this comprehensive treatise focusses on Buchberger theory and its application to the algorithmic view of commutative algebra. In distinction from other works, the presentation here is based on the intrinsic linear algebra structure of Grobner bases, and thus elementary considerations lead to an easy introduction to the state of the art in issues of implementation. The same language describes the applications of Grobner technology to the central problems of commutative alegbra (from Hilbert function and resolution computation, up to the Lasker-Noether decomposition). At the same time, the book can be used as a reference on elementary ideal theory and a source for the state of the art in its algorithmization. The efficiency of this algorithmization is shown by its ability to link the new Grobner technology with the old combinatorial and linear algebra approach performed and advocated by Macaulay; such a paradigm is discussed and illustrated in this book, which also gives a careful commentary of Macaulay's notion of inverse systems and algorithms for computing them. Aiming to be a complete survey on Grobner bases and their applications, the book also includes the advanced aspects of Buchberger theory, such as the complexity of the algorithm, Galligo's theorem, the optimality of degrevlex, the Gianni-Kalkbrener theorem, the FGLM algorithm, and so on. Thus it will be essential for all workers in commutative algebra, computational algebra and algebraic geometry. Book jacket."--BOOK JACKET Polynomial equations have been long studied, both theoretically and with a view to solving them. Until recently, manual computation was the only solution method and the theory was developed to accommodate it. With the advent of computers, the situation changed dramatically. Many classical results can be more usefully recast within a different framework which in turn lends itself to further theoretical development tuned to computation. This first book in a trilogy is devoted to the new approach. It is a handbook covering the classical theory of finding roots of a univariate polynomial, emphasising computational aspects, especially the representation and manipulation of algebraic numbers, enlarged by more recent representations like the Duval Model and the Thom Codification. Mora aims to show that solving a polynomial equation really means finding algorithms that help one manipulate roots rather than simply computing them; to that end he also surveys algorithms for factorizing univariate polynomials. "In this fourth and final volume the author extends Buchberger's Algorithm in three different directions. First, he extends the theory to group rings and other Ore-like extensions, and provides an operative scheme that allows one to set a Buchberger theory over any effective associative ring. Second, he covers similar extensions as tools for discussing parametric polynomial systems, the notion of SAGBI-bases, Gröbner bases over invariant rings and Hironaka's theory. Finally, Mora shows how Hilbert's followers - notably Janet, Gunther and Macaulay - anticipated Buchberger's ideas and discusses the most promising recent alternatives by Gerdt (involutive bases) and Faugère (F4 and F5). This comprehensive treatment in four volumes is a significant contribution to algorithmic commutative algebra that will be essential reading for algebraists and algebraic geometers."--Page [4] of cover With the advent of computers, theoretical studies and solution methods for polynomial equations have changed dramatically. Many classical results can be more usefully recast within a different framework which in turn lends itself to further theoretical development tuned to computation. This first book in a trilogy is devoted to the new approach. It is a handbook covering the classical theory of finding roots of a univariate polynomial, emphasizing computational aspects, especially the representation and manipulation of algebraic numbers, enlarged by more recent representations like the Duval Model and the Thom Codification. Mora aims to show that solving a polynomial equation really means finding algorithms that help one manipulate roots rather than simply computing them; to that end he also surveys algorithms for factorizing univariate polynomials. This third volume of four finishes the program begun in Volume 1 by describing all the most important techniques, mainly based on Gröbner bases, which allow one to manipulate the roots of the equation rather than just compute them. The book begins with the 'standard' solutions (Gianni?Kalkbrener Theorem, Stetter Algorithm, Cardinal?Mourrain result) and then moves on to more innovative methods (Lazard triangular sets, Rouillier's Rational Univariate Representation, the TERA Kronecker package). The author also looks at classical results, such as Macaulay's Matrix, and provides a historical survey of elimination, from Bézout to Cayley. This comprehensive treatment in four volumes is a significant contribution to algorithmic commutative algebra that will be essential reading for algebraists and algebraic geometers A complete survey of Gröbner bases and their applications, this book will be essential for all workers in commutative algebra, computational algebra and algebraic geometry. The second volume of the treatise focuses on Buchberger theory and its application to the algorithmic view of commutative algebra. In distinction to other works, the presentation is based on the intrinsic linear algebra structure of Gröbner bases, making this a state-of-the-art reference on issues of implementation. A complete survey of Grobner bases and their applications, this book will be essential for all workers in commutative algebra, computational algebra and algebraic geometry. The second volume of the treatise focuses on Buchberger theory and its application to the algorithmic view of commutative algebra. In distinction to other works, the presentation is based on the intrinsic linear algebra structure of Grobner bases, making this a state-of-the-art reference on issues of implementation. This preliminary chapter is just devoted to recalling the Euclidean Algorithms over a univariate polynomial ring and its elementary applications: roughly speaking they are essentially the obvious generalization of those over integers. 1. The Kronecker-duval Philosophy -- 2. Macaulay's Paradigm And Gröbner Technology -- 3. Algebraic Solving -- 4. Buchberger Theory And Beyond. Teo Mora, University Of Genoa. Includes Bibliographical References And Indexes. Let k be an infinite, perfect field, where, if p := char(k) 0, it is possible to extract pth roots, and let k be an algebraically closed extension of k.