Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra / Edition 4

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra / Edition 4

ISBN-10:
3319167200
ISBN-13:
9783319167206
Pub. Date:
04/30/2015
Publisher:
Springer International Publishing
ISBN-10:
3319167200
ISBN-13:
9783319167206
Pub. Date:
04/30/2015
Publisher:
Springer International Publishing
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra / Edition 4

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra / Edition 4

$49.99 Current price is , Original price is $49.99. You
$49.99 
  • SHIP THIS ITEM
    Temporarily Out of Stock Online
  • PICK UP IN STORE
    Check Availability at Nearby Stores
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.

Temporarily Out of Stock Online


Overview

This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the Preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry—the elimination theorem, the extension theorem, the closure theorem and the Nullstellensatz—this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new Chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D).

The book may serve as a first or second course in undergraduate abstract algebra and with some supplementation perhaps, for beginning graduate levelcourses in algebraic geometry or computational algebra. Prerequisites for the reader include linear algebra and a proof-oriented course. It is assumed that the reader has access to a computer algebra system. Appendix C describes features of Maple™, Mathematica® and Sage, as well as other systems that are most relevant to the text. Pseudocode is used in the text; Appendix B carefully describes the pseudocode used.

Readers who are teaching from Ideals, Varieties, and Algorithms, or are studying the book on their own, may obtain a copy of the solutions manual by sending an email to jlittle@holycross.edu.

From the reviews of previous editions:

“…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 an excellent guide to introduce further undergraduates in the algorithmic aspect of commutative algebra and algebraic geometry.”

—Peter Schenzel, zbMATH, 2007

“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


Product Details

ISBN-13: 9783319167206
Publisher: Springer International Publishing
Publication date: 04/30/2015
Series: Undergraduate Texts in Mathematics
Edition description: 4th ed. 2015
Pages: 646
Product dimensions: 6.10(w) x 9.25(h) x 0.06(d)

About the Author

David A. Cox is currently Professor of Mathematics at Amherst College. John Little is currently Professor of Mathematics at College of the Holy Cross. Donal O'Shea is currently President and Professor of Mathematics at New College of Florida.

Table of Contents

Preface.- Notation for Sets and Functions.- 1. Geometry, Algebra, and Algorithms.- 2. Groebner Bases.- 3. Elimination Theory.- 4.The Algebra-Geometry Dictionary.- 5. Polynomial and Rational Functions on a Variety.- 6. Robotics and Automatic Geometric Theorem Proving.- 7. Invariant Theory of Finite Groups.- 8. Projective Algebraic Geometry.- 9. The Dimension of a Variety.- 10. Additional Groebner Basis Algorithms.- Appendix A. Some Concepts from Algebra.- Appendix B. Pseudocode.- Appendix C. Computer Algebra Systems.- Appendix D. Independent Projects.- References.- Index.
From the B&N Reads Blog

Customer Reviews