Ideals, Varieties, and Algorithms
Summary
The feel-good place to buy books
Ideals, Varieties, and Algorithms by David A Cox
This book details the heart and soul of modern commutative and algebraic geometry. It covers such topics as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory. In addition to enhancing the text of the second edition, with over 200 pages reflecting changes to enhance clarity and correctness, this third edition of Ideals, Varieties and Algorithms includes: a significantly updated section on Maple; updated information on AXIOM, CoCoA, Macaulay 2, Magma, Mathematica and SINGULAR; and presents a shorter proof of the Extension Theorem.
From the reviews of the third edition: "The book gives an introduction to Buchberger's algorithm with applications to syzygies, Hilbert polynomials, primary decompositionsThere is an introduction to classical algebraic geometry with applications to the ideal membership problem, solving polynomial equations, and elimination theory. ... The book is well-written. ... The reviewer is sure that it will be a excellent guide to introduce further undergraduates in the algorithmic aspect of commutative algebra and algebraic geometry." (Peter Schenzel, Zentralblatt MATH, Vol. 1118 (20), 2007)
| SKU | Unavailable |
| ISBN 13 | 9780387356501 |
| ISBN 10 | 0387356509 |
| Title | Ideals, Varieties, and Algorithms |
| Author | David A Cox |
| Series | Undergraduate Texts In Mathematics |
| Condition | Unavailable |
| Publisher | Springer-Verlag New York Inc. |
| Year published | 2007-01-01 |
| Number of pages | 553 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |
