DeepRead
Cover of Ideals, varieties, and algorithms

Ideals, varieties, and algorithms

David A. Cox, David Cox, John Little, Donal O'Shea · 1992

Mathematics and physics › Abstract algebra and number theory

#4,931 most recommended

About the book

An undergraduate-level introduction to algebraic geometry, covering systems of polynomial equations, their solution sets (varieties), and the ideals that correspond to them. Topics include the Hilbert Basis Theorem, the Nullstellensatz, projective geometry, invariant theory, and dimension theory. The book presents the correspondence between ideals and varieties as the core link between algebra and geometry, and treats computation as part of that link rather than a side topic. It builds its algorithms on a generalization of the one-variable division algorithm, which is the basis of Gröbner bases and Buchberger's algorithm, and uses it to answer questions such as whether a system has finitely many solutions and how infinite solution sets can be described. It also points to applications in areas such as robotics and geometric theorem proving.

Written by Claude from what it knows of this book.

What Hacker News says 75% recommend · 0% critical

0122014202020262014 peak · 2
This bookAverage book in Abstract algebra and number theory

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 4 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1992
ISBN
9783319167206
Editions known
20 at Open Library
Open Library
OL1849157W

37784647516.3/561356291AbstractAlgebraAlgebra, data processingAlgebraicAlgebraic GeometryCommutative Rings and AlgebrasCommutative algebraCommutative algebra--data processingComputer software

Explore in the mosaic

Read next: its neighbours on the mosaic