Verwandte Artikel zu Ideals, Varieties, and Algorithms: An Introduction...
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (Undergraduate Texts in Mathematics) - Hardcover
Inhaltsangabe
Book by Cox David Little John OShea Donal
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Críticas
"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
Reseña del editor
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.
- VerlagSpringer Verlag
- Erscheinungsdatum1996
- ISBN 10 0387946802
- ISBN 13 9780387946801
- EinbandTapa dura
- SpracheEnglisch
- Anzahl der Seiten549
Gebraucht kaufen
Zustand: BefriedigendSpringer, 1997. Cover very faintly...
Diesen Artikel anzeigen
EUR 51,76
EUR 1,73 für den Versand innerhalb von/der USA
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Ideals, Varieties, and Algorithms: An Introduction...
Beispielbild für diese ISBN
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (Undergraduate Texts in Mathematics)
Anbieter: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, USA
Verkäuferbewertung 5 von 5 Sternen
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. Artikel-Nr. 618992
Anzahl: 1 verfügbar
Foto des Verkäufers
Ideals, varieties, and algorithms : an introduction to computational algebraic geometry and commutative algebra / David Cox ; John Little ; Donal O`Shea / Undergraduate texts in mathematics
ISBN 10: 0387946802
ISBN 13: 9780387946801
Gebraucht
Hardcover
Anbieter: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Hardcover. 2. ed. XIII, 536 p. : graph. Darst. ; 25 cm New! 9780387946801 Sprache: Englisch Gewicht in Gramm: 907. Artikel-Nr. 200213
Anzahl: 1 verfügbar
Foto des Verkäufers
Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra.
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Hardcover. 2. ed. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. C-00976 9780387946801 Sprache: Englisch Gewicht in Gramm: 1050. Artikel-Nr. 2484819
Anzahl: 1 verfügbar
Foto des Verkäufers
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra (Undergraduate Texts in Mathematics) An Introduction to Computational Algebraic Geometry and Commutative Algebra
Anbieter: Antiquariat Jochen Mohr -Books and Mohr-, Oberthal, Deutschland
Verkäuferbewertung 5 von 5 Sternen
hardcover. Zustand: Sehr gut. 551 Seiten 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 book bases its discussion of algorithms on a generalisation 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 this new edition, the authors present an improved proof of the Buchberger Criterion as well as a proof of Bezout's Theorem. 9780387946801 Wir verkaufen nur, was wir auch selbst lesen würden. Sprache: Deutsch Gewicht in Gramm: 950 Auflage: 2nd ed. 1997. Corr. 5th printing. Artikel-Nr. 89119
Anzahl: 1 verfügbar