Computational Methods in Commutative Algebra and Algebraic Geometry (Algorithms and Computation in Mathematics, 2)

This book gives an account of recent developments on the interplay between theoretical aspects of commutative algebra and algebraic geometry and computational issues in algebra. A great deal of emphasis is given to the fact that the non-elementary complexity of the underlying fundamental algorithms and data structures (e.g. factorization, Gröbner bases, matrices with polynomial entries) require that the cost of computation be borne largely by theoretical means. The material is focused on the explicit construction of basic objects of algebrogeometric interest - primary decomposition, integral closure, computation of ideal transforms and cohomology, among others. It looks also at various numerical signatures of rings and modules such as those obtained from their Hilbert functions. Another feature is an analysis of nonlinear systems of polynomial equations with the view as to how best deliver the equations to numerical solvers. There are numerous pointers to the current literature, which together with the exercises and a selected set of challenge questions round the text.

From the reviews of the hardcover edition:

"... Many parts of the book can be read by anyone with a basic abstract algebra course. It seems to the reviewer that it was one of the author's intentions to equip students who are interested in computational problems with the necessary algebraic background in pure mathematics and to encourage them to do further research in commutative algebra and algebraic geometry. But researchers will also benefit from this exposition. They will find an up-to-date description of the related research. ... The reviewer recommends the book to anybody who is interested in commutative algebra and algebraic geometry and its computational aspects." (P.Schenzel, Mathematical Reviews 2002)