Computational Algebraic Geometry

A quick guide to computing in algebraic geometry with many explicit computational examples introducing the computer algebra system Singular.

The interplay between algebra and geometry is a beautiful (and fun!) area of mathematical investigation. Advances in computing and algorithms make it possible to tackle many classical problems in a down-to-earth and concrete fashion. This opens wonderful new vistas and allows us to pose, study and solve problems that were previously out of reach. Suitable for graduate students, the objective of this 2003 book is to bring advanced algebra to life with lots of examples. The first chapters provide an introduction to commutative algebra and connections to geometry. The rest of the book focuses on three active areas of contemporary algebra: Homological Algebra (the snake lemma, long exact sequence inhomology, functors and derived functors (Tor and Ext), and double complexes); Algebraic Combinatorics and Algebraic Topology (simplicial complexes and simplicial homology, Stanley-Reisner rings, upper bound theorem and polytopes); and Algebraic Geometry (points and curves in projective space, Riemann-Roch, Cech cohomology, regularity).

The theory and practice of computation in algebraic geometry and related domains, from a mathematical point of view, has generated an increasing interest both for its rich theoretical possibilities and its usefulness in applications in science and engineering. In fact, it is one of the master keys for future significant improvement of the computer algebra systems (e.g., Reduce, Macsyma, Maple, Mathematica, Axiom, Macaulay, etc.) that have become such useful tools for many scientists in a variety of disciplines. The major themes covered in this volume, arising from papers p- sented at the conference MEGA-92 were: - Effective methods and complexity issues in commutative algebra, projective geometry, real geometry, and algebraic number theory - Algebra-geometric methods in algebraic computing and applica tions. MEGA-92 was the second of a new series of European conferences on the general theme of Effective Methods in Algebraic Geometry. It was held in Nice, France, on April 21-25, 1992 and built on the themes presented at MEGA-90 (Livomo, Italy, April 17-21, 1990). The next conference - MEGA-94 - will be held in Santander, Spain in the spring of 1994. The Organizing committee that initiatiod and supervises this bi enniel conference consists of A. Conte (Torino), J.H. Davenport (Bath), A. Galligo (Nice), D. Yu. Grigoriev (Petersburg), J. Heintz (Buenos Aires), W. Lassner (Leipzig), D. Lazard (paris), H.M. MOller (Hagen), T. Mora (Genova), M. Pohst (DUsseldort), T. Recio (Santander), J.J.

Polyhedral and Algebraic Methods in Computational Geometry provides a thorough introduction into algorithmic geometry and its applications. It presents its primary topics from the viewpoints of discrete, convex and elementary algebraic geometry. The first part of the book studies classical problems and techniques that refer to polyhedral structures. The authors include a study on algorithms for computing convex hulls as well as the construction of Voronoi diagrams and Delone triangulations. The second part of the book develops the primary concepts of (non-linear) computational algebraic geometry. Here, the book looks at Gröbner bases and solving systems of polynomial equations. The theory is illustrated by applications in computer graphics, curve reconstruction and robotics. Throughout the book, interconnections between computational geometry and other disciplines (such as algebraic geometry, optimization and numerical mathematics) are established. Polyhedral and Algebraic Methods in Computational Geometry is directed towards advanced undergraduates in mathematics and computer science, as well as towards engineering students who are interested in the applications of computational geometry.

This book presents algorithmic tools for algebraic geometry, with experimental applications. It also introduces Macaulay 2, a computer algebra system supporting research in algebraic geometry, commutative algebra, and their applications. The algorithmic tools presented here are designed to serve readers wishing to bring such tools to bear on their own problems. The first part of the book covers Macaulay 2 using concrete applications; the second emphasizes details of the mathematics.

Written at a level appropriate to undergraduates, this book covers such topics as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory. Contains a new section on Axiom and an update about MAPLE, Mathematica and REDUCE.

This ACM volume deals with tackling problems that can be represented by data structures which are essentially matrices with polynomial entries, mediated by the disciplines of commutative algebra and algebraic geometry. The discoveries stem from an interdisciplinary branch of research which has been growing steadily over the past decade. The author covers a wide range, from showing how to obtain deep heuristics in a computation of a ring, a module or a morphism, to developing means of solving nonlinear systems of equations - highlighting the use of advanced techniques to bring down the cost of computation. Although intended for advanced students and researchers with interests both in algebra and computation, many parts may be read by anyone with a basic abstract algebra course.

This book provides a quick access to computational tools for algebraic geometry, the mathematical discipline which handles solution sets of polynomial equations. Originating from a number of intense one week schools taught by the authors, the text is designed so as to provide a step by step introduction which enables the reader to get started with his own computational experiments right away. The authors present the basic concepts and ideas in a compact way.