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 516.35
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)
Publication New York, NY : Springer , 1992.
Physical Details XI, 514 p. 43 illus. : online resource.
Series Undergraduate texts in mathematics 0172-6056
ISBN 9781475721812
Summary Note 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.:
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. Maple -- §2. Mathematica -- §3. REDUCE -- §4. 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 48366 Beginning of record . Catalogue Information 48366 Top of page .


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