Nicht aus der Schweiz? Besuchen Sie lehmanns.de

Ideals, Varieties, and Algorithms

An Introduction to Computational Algebraic Geometry and Commutative Algebra
XI, 513 Seiten
1995 | 199., Corr. 3rd printing
Springer Berlin (Hersteller)
978-3-540-97847-3 (ISBN)

Lese- und Medienproben

CHF 51,50 inkl. MwSt
zur Neuauflage
  • Titel erscheint in neuer Auflage
  • Artikel merken
Zu diesem Artikel existiert eine Nachauflage
Written at an undergraduate level, this textbook emphasizes applications and the computational and algorithmic aspects of algebraic geometry and commutative algebra. It covers such topics as the Hilbert Basis Theorem, invariant theory, protective geometry and dimensional theory.
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 1960s. 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 led to some interesting applications, for example in robotics and in geometric theorem proving. This book is an introduction to algebraic geometry and commutative algebra aimed primarily at undergraduates. Emphasizing applications and the computational and algorithmic aspects of the subject, the text has less abstract flavour than standard treatments. With few prerequisites, it should also a useful introduction to the subject for computer scientists.
Reihe/Serie Undergraduate Texts in Mathematics
Zusatzinfo 83 figs.
Verlagsort Berlin
Sprache englisch
Gewicht 590 g
Einbandart gebunden
Themenwelt Mathematik / Informatik Mathematik Geometrie / Topologie
ISBN-10 3-540-97847-X / 354097847X
ISBN-13 978-3-540-97847-3 / 9783540978473
Zustand Neuware
Haben Sie eine Frage zum Produkt?