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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
"I consider the book to be wonderful...The exposition is very clear, there are many helpful pictures, and there are a great many instructive exercises, some quite challenging...offers the heart and soul of modern commutative and algebraic geometry." -The American Mathematical Monthly
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: HPB-Red, Dallas, TX, USA
Hardcover. Zustand: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Bestandsnummer des Verkäufers S_449113942
Anbieter: Better World Books, Mishawaka, IN, USA
Zustand: Good. 2nd. Used book that is in clean, average condition without any missing pages. Bestandsnummer des Verkäufers 9601673-6
Anbieter: Romtrade Corp., STERLING HEIGHTS, MI, USA
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide. Bestandsnummer des Verkäufers ABNR-86844
Anbieter: Basi6 International, Irving, TX, USA
Zustand: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Bestandsnummer des Verkäufers ABEOCT25-85683
Anbieter: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, USA
Zustand: Good. Springer, 1997. Cover very faintly rubbed/bumped/soiled, corners ever-so-slightly rubbed, spine ends lightly bumped; edges faintly soiled; binding tight; cover, edges, and interior intact and clean except as noted. hardcover. Good. Bestandsnummer des Verkäufers 618992
Anbieter: Toscana Books, AUSTIN, TX, USA
Hardcover. Zustand: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Bestandsnummer des Verkäufers Scanned0387946802
Anbieter: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Deutschland
Hardcover. 2. ed. XIII, 536 p. : graph. Darst. ; 25 cm New! 9780387946801 Sprache: Englisch Gewicht in Gramm: 907. Bestandsnummer des Verkäufers 200213
Anzahl: 1 verfügbar
Anbieter: Librairie Parrêsia, Figeac, Frankreich
Hardcover Feb 24, 2006. Zustand: Used: Very Good. Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra | Cox, Little, O'Shea | Springer, 1992, in-8 cartonnage éditeur, 536 pages. Couverture en bel état général. Intérieur bien frais. [BT69+]. Bestandsnummer des Verkäufers 0828U7I0NJ7
Anzahl: 1 verfügbar
Anbieter: Books Puddle, New York, NY, USA
Zustand: New. pp. 556 2nd Edition. Bestandsnummer des Verkäufers 263126221
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
Zustand: New. pp. 556. Bestandsnummer des Verkäufers 5770258
Anzahl: 1 verfügbar