Skip to main content

Ideals, Varieties, and Algorithms

An Introduction to Computational Algebraic Geometry and Commutative Algebra

  • Textbook
  • © 2007

Overview

  • Covers important topics such as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory
  • Includes a significantly updated section on Maple in Appendix C
  • Contains updated information on AXIOM, CoCoA, Macaulay 2, Magma, Mathematica and SINGULAR
  • A shorter proof of the Extension Theorem is presented in Section 6 of Chapter 3
  • Over 200 pages reflect changes as compared to the 2nd edition to enhance clarity and correctness
  • Written at a level appropriate to undergraduates

Part of the book series: Undergraduate Texts in Mathematics (UTM)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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. Although the algorithmic roots of algebraic geometry are old, it is only in the last forty years that computational methods have regainedtheir earlier prominence. New algorithms, coupled with the power of fast computers, have led to both theoretical advances and interesting applications, for example in robotics and in geometric theorem proving.

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 in Appendix C; Updated information on AXIOM, CoCoA, Macaulay 2, Magma, Mathematica and SINGULAR; A shorter proof of the Extension Theorem presented in Section 6 of Chapter 3.

From the 2nd edition: "I consider the book to be wonderful. ... The exposition is very clear, there are many helpful pictures, and there are a great many instructive exercises, some quite challenging ... offers the heart and soul of modern commutative and algebraic geometry." The American Mathematical Monthly

Similar content being viewed by others

Keywords

Table of contents (9 chapters)

Reviews

From the reviews of the third edition:

"The book gives an introduction to Buchberger’s algorithm with applications to syzygies, Hilbert polynomials, primary decompositions. There 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)

Authors and Affiliations

  • Department of Mathematics and Computer Science, Amherst College, Amherst, USA

    David Cox

  • Department of Mathematics and Computer Science, College of the Holy Cross, Worcester, USA

    John Little

  • Department of Mathematics and Statistics, Mount Holyoke College, South Hadley, USA

    Donal O’Shea

Bibliographic Information

Publish with us