HomeGroupsTalkZeitgeist
Hide this

Results from Google Books

Click on a thumbnail to go to Google Books.

Ideals, Varieties, and Algorithms: An…
Loading...

Ideals, Varieties, and Algorithms: An Introduction to Computational…

by David Cox, John Little, Donal O'Shea

MembersReviewsPopularityAverage ratingConversations
75None160,370 (4.25)None

None.

None
Loading...

Sign up for LibraryThing to find out whether you'll like this book.

No current Talk conversations about this book.

No reviews
no reviews | add a review

» Add other authors

Author nameRoleType of authorWork?Status
Cox, Davidprimary authorall editionsconfirmed
Little, Johnmain authorall editionsconfirmed
O'Shea, Donalmain authorall editionsconfirmed
You must log in to edit Common Knowledge data.
For more help see the Common Knowledge help page.
Series (with order)
Canonical title
Original title
Alternative titles
Original publication date
People/Characters
Important places
Important events
Related movies
Awards and honors
Epigraph
Dedication
First words
Quotations
Last words
Disambiguation notice
Publisher's editors
Blurbers
Publisher series
Original language
Book description
Haiku summary

Amazon.com Product Description (ISBN 0387946802, Hardcover)

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. This book bases its discussion of algorithms on a generalization of the division algorithm for polynomials in one variable that was only discovered in the 1960's. Although the algorithmic roots of algebraic geometry are old, the computational aspects were neglected earlier in this century. This has changed in recent years, and new algorithms, coupled with the power of fast computers, have let to some interesting applications, for example in robotics and in geometric theorem proving. In preparing a new edition of Ideals, Varieties and Algorithms the authors present an improved proof of the Buchberger Criterion as well as a proof of Bezout's Theorem. Appendix C contains a new section on Axiom and an update about Maple , Mathematica and REDUCE.

(retrieved from Amazon Thu, 12 Mar 2015 18:14:06 -0400)

(see all 2 descriptions)

No library descriptions found.

Quick Links

Swap Ebooks Audio
3 wanted1 pay

Popular covers

Rating

Average: (4.25)
0.5
1
1.5
2
2.5
3 1
3.5
4 4
4.5
5 3

Is this you?

Become a LibraryThing Author.

 

About | Contact | Privacy/Terms | Help/FAQs | Blog | Store | APIs | TinyCat | Legacy Libraries | Early Reviewers | Common Knowledge | 120,808,091 books! | Top bar: Always visible