Home / Science / Mathematics / Algebra / Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra

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

AUTHORS
Price
€62.00
Upon request
Dispatched within 15 - 25 days.

Add to wishlist

Free shipping

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 level courses 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.

Authors: Cox David, Little John, O'Shea Donal
Publisher: SPRINGER
Pages: 646
ISBN: 9783319167206
Cover: Hardback
Edition Number: 4
Release Year: 2015

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.

David Cox is Professor of Mathematics at Amherst College.

John Little is Professor of Mathematics at College of the Holy Cross.

Donal O’Shea is the Elizabeth T. Kennan Professor of Mathematics and Dean of Faculty at Mt. Holyoke College.

These authors also co-wrote the immensely successful book, Ideals, Varieties, and Algorithms.

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.

You may also like

Newsletter

Subscribe to the newsletter to be the first to receive our new releases and offers
Your account Your wishlist