Cantitate/Preț
Produs

Computations in Algebraic Geometry with Macaulay 2: Algorithms and Computation in Mathematics, cartea 8

Editat de David Eisenbud, Daniel R. Grayson, Mike Stillman, Bernd Sturmfels
en Limba Engleză Hardback – 25 sep 2001
Systems of polynomial equations arise throughout mathematics, science, and engineering. Algebraic geometry provides powerful theoretical techniques for studying the qualitative and quantitative features of their solution sets. Re­ cently developed algorithms have made theoretical aspects of the subject accessible to a broad range of mathematicians and scientists. The algorith­ mic approach to the subject has two principal aims: developing new tools for research within mathematics, and providing new tools for modeling and solv­ ing problems that arise in the sciences and engineering. A healthy synergy emerges, as new theorems yield new algorithms and emerging applications lead to new theoretical questions. This book presents algorithmic tools for algebraic geometry and experi­ mental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems. A wide range of mathematical scientists should find these expositions valuable. This includes both the users of other programs similar to Macaulay 2 (for example, Singular and CoCoA) and those who are not interested in explicit machine computations at all.
Citește tot Restrânge

Din seria Algorithms and Computation in Mathematics

Preț: 38285 lei

Puncte Express: 574

Carte tipărită la comandă

Livrare economică 29 mai-12 iunie


Specificații

ISBN-13: 9783540422303
ISBN-10: 3540422307
Pagini: 350
Ilustrații: XV, 329 p. 1 illus.
Dimensiuni: 155 x 235 x 25 mm
Greutate: 0.65 kg
Ediția:2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Algorithms and Computation in Mathematics

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Graduate

Cuprins

I Introducing Macaulay 2.- Ideals, Varieties and Macaulay 2.- Projective Geometry and Homological Algebra.- Data Types, Functions, and Programming.- Teaching the Geometry of Schemes.- II Mathematical Computations.- Monomial Ideals.- From Enumerative Geometry to Solving Systems of Polynomial Equations.- Resolutions and Cohomology over Complete Intersections.- Algorithms for the Toric Hilbert Scheme.- Sheaf Algorithms Using the Exterior Algebra.- Needles in a Haystack: Special Varieties via Small Fields.- D-modules and Cohomology of Varieties.

Caracteristici

Only textbook using Macaulay as a tool Computational algebraic geometry presented in the optimal way by top researchers Includes supplementary material: sn.pub/extras