Computations in Algebraic Geometry with Macaulay 2 edited by David Eisenbud, Daniel R. Grayson, Mike Stillman, Bernd Sturmfels.

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

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Eisenbud, David (Editor), Grayson, Daniel R. (Editor), Stillman, Mike (Editor), Sturmfels, Bernd (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Edition:1st ed. 2002.
Series:Algorithms and Computation in Mathematics, 8
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • 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.