Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
Author(s)
Bibliographic Information
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
（Undergraduate texts in mathematics）
Springer, c2010
3rd ed
- : [pbk.]
Available at / 6 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references (p. 535-539) and index
Description and Table of Contents
Description
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.
Table of Contents
Geometry, Algebra, and Algorithms.- Groebner Bases.- Elimination Theory.- The Algebra-Geometry Dictionary.- Polynomial and Rational Functions on a Variety.- Robotics and Automatic Geometric Theorem Proving.- Invariant Theory of Finite Groups.- Projective Algebraic Geometry.- The Dimension of a Variety.
by "Nielsen BookData"
