Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

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
Catalogue Information
Field name Details
Dewey Class 511.3
Title Ideals, Varieties, and Algorithms ([EBook]) : An Introduction to Computational Algebraic Geometry and Commutative Algebra / by David Cox, John Little, Donal O’Shea.
Author Cox, David A.
Added Personal Name Little, John
O'Shea, Donal
Other name(s) SpringerLink (Online service)
Edition statement Second Edition.
Publication New York, NY : Springer , 1997.
Physical Details XIII, 538 p. 44 illus. : online resource.
Series Undergraduate texts in mathematics 0172-6056
ISBN 9781475726930
Summary Note 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.:
Contents note 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 -- Appendix A. Some Concepts from Algebra -- §1 Fields and Rings -- §2. Groups -- §3. Determinants -- Appendix B. Pseudocode -- §1. Inputs, Outputs, Variables, and Constants -- §2. Assignment Statements -- §3. Looping Structures -- §4. Branching Structures -- Appendix C. Computer Algebra Systems -- §1. AXIOM -- §2. Maple -- §3. Mathematica -- §4. REDUCE -- §5. Other Systems -- Appendix D. Independent Projects -- §1. General Comments -- §2. Suggested Projects -- References.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site
Links to Related Works
Subject References:
Corporate Authors:
Catalogue Information 44690 Beginning of record . Catalogue Information 44690 Top of page .


This item has not been rated.    Add a Review and/or Rating44690
. E-mail This Page
Quick Search