Ideals, Varieties, and Algorithms by David A Cox

Skip to product information
1 of 1

Ideals, Varieties, and Algorithms by David A Cox

Summary

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. It includes appendix C, which contains a section on Axiom and details about Maple, Mathematica and REDUCE.

The feel-good place to buy books
  • Free shipping in the US over $15
  • Supporting authors with AuthorSHARE
  • 100% recyclable packaging
  • Proud to be a B Corp – A Business for good
  • Sell-back with World of Books - Sell your Books

Ideals, Varieties, and Algorithms by David A Cox

Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the system have finitely many solutions, and if so how can one find them? And if there are infinitely many solutions, how can they be described and manipulated? The solutions of a system of polynomial equations form a geometric object called a variety; the corresponding algebraic object is an ideal. There is a close relationship between ideals and varieties which reveals the intimate link between algebra and geometry. 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. The algorithms to answer questions such as those posed above are an important part of algebraic geometry. This book bases its discussion of algorithms on a generalization of the division algorithm for polynomials in one variable that was only discovered in the 1960's. Although the algorithmic roots of algebraic geometry are old, the computational aspects were neglected earlier in this century. This has changed in recent years, and new algorithms, coupled with the power of fast computers, have let to some interesting applications, for example in robotics and in geometric theorem proving. In preparing a new edition of Ideals, Varieties and Algorithms the authors present an improved proof of the Buchberger Criterion as well as a proof of Bezout's Theorem. Appendix C contains a new section on Axiom and an update about Maple , Mathematica and REDUCE.
SKU Unavailable
ISBN 13 9780387946801
ISBN 10 0387946802
Title Ideals, Varieties, and Algorithms
Author David A Cox
Series Undergraduate Texts In Mathematics
Condition Unavailable
Publisher Springer-Verlag New York Inc.
Year published 2006-02-24
Number of pages 549
Cover note Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
Note Unavailable