TY  - BOOK
AU  - Cox,David
AU  - Little,John
AU  - O'Shea,Donald
TI  - Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra 
T2  - Undergraduate texts in mathematics
SN  - 0-387-35650-9
PY  - 2007///
CY  - San Francisco
PB  - Springer
KW  - Álgebra conmutativa
KW  - Algebra y Geometria
KW  - Geometría algebraica
N1  - Indice; Bibliografía: p. 535-539
N2  - 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.   INDICE: Geometry, Algebra, and Algorithms.- Groebner Bases.- Elimination Theory.- The Algebra-Geometry Dictionary.- Polynomial and Rational Functions on a Variety.- Robotics and Automatic Geometric Theorem Proving.- Invariant Theory of Finite Groups.- Projective Algebraic Geometry.- The Dimension of a Variety.- Some Concepts from Algebra.- Pseudocode.- Computer Algebra Systems.- Independent Projects
ER  -