Nothing Special   »   [go: up one dir, main page]

Skip to main content

Ideals, Varieties, and Algorithms

An Introduction to Computational Algebraic Geometry and Commutative Algebra

  • Textbook
  • © 1992

Overview

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
$34.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 74.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

We wrote this book to introduce undergraduates to some interesting ideas in algebraic geometry and commutative algebra. Until recently, these topics involved a lot of abstract mathematics and were only taught in graduate school. But in the 1960's, Buchberger and Hironaka discovered new algorithms for manipulating systems of polynomial equations. Fueled by the development of computers fast enough to run these algorithms, the last two decades have seen a minor revolution in commutative algebra. The ability to compute efficiently with polynomial equations has made it possible to investigate complicated examples that would be impossible to do by hand, and has changed the practice of much research in algebraic geometry. This has also enhanced the importance of the subject for computer scientists and engineers, who have begun to use these techniques in a whole range of problems. It is our belief that the growing importance of these computational techniques warrants their introduction into the undergraduate (and graduate) mathematics curricu­ lum. Many undergraduates enjoy the concrete, almost nineteenth century, flavor that a computational emphasis brings to the subject. At the same time, one can do some substantial mathematics, including the Hilbert Basis Theorem, Elimination Theory and the Nullstellensatz. The mathematical prerequisites of the book are modest: the students should have had a course in linear algebra and a course where they learned how to do proofs. Examples of the latter sort of course include discrete math and abstract algebra.

Similar content being viewed by others

Keywords

Table of contents (9 chapters)

Authors and Affiliations

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

    David Cox

  • Department of Mathematics, College of the Holy Cross, Worcester, USA

    John Little

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

    Donal O’Shea

Bibliographic Information

  • Book Title: Ideals, Varieties, and Algorithms

  • Book Subtitle: An Introduction to Computational Algebraic Geometry and Commutative Algebra

  • Authors: David Cox, John Little, Donal O’Shea

  • Series Title: Undergraduate Texts in Mathematics

  • DOI: https://doi.org/10.1007/978-1-4757-2181-2

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 1992

  • eBook ISBN: 978-1-4757-2181-2Published: 17 April 2013

  • Series ISSN: 0172-6056

  • Series E-ISSN: 2197-5604

  • Edition Number: 1

  • Number of Pages: XI, 514

  • Number of Illustrations: 43 b/w illustrations

  • Topics: Algebraic Geometry

Publish with us