Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra

David Cox, John Little, Donal O'Shea

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.

「Nielsen BookData」より


  • 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.

「Nielsen BookData」より


書名 Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra
著作者等 Cox, David A
Little, John B
O'Shea, Donal
O'Shea D.
Little J.B.
シリーズ名 Undergraduate texts in mathematics
出版元 Springer
刊行年月 c1997
版表示 2nd ed
ページ数 xiii, 536 p.
大きさ 25 cm
ISBN 0387946802
NCID BA29043814
※クリックでCiNii Booksを表示
言語 英語
出版国 アメリカ合衆国