𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing in algebraic geometry and commutative algebra using Macaulay 2

✍ Scribed by Michael Stillman

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
167 KB
Volume
36
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

✦ Synopsis

We present recent research of Eisenbud, FlΓΈystad, Schreyer, and others, which was discovered with the help of experimentation with Macaulay 2. In this invited, expository paper, we start by considering the exterior algebra, and the computation of GrΓΆbner bases. We then present, in an elementary manner, the explicit form of the Bernstein-Gelfand-Gelfand relationship between graded modules over the polynomial ring and complexes over the exterior algebra, that Eisenbud, FlΓΈystad and Schreyer found. We present two applications of these techniques: cohomology of sheaves, and the construction of determinantal formulae for (powers of) Macaulay resultants. We show how to use Macaulay 2 to perform these computations.

πŸ“œ SIMILAR VOLUMES

Constructions in Finite Geometry Using C
Constructions in Finite Geometry Using Computer Algebra Systems
✍ G.L. Ebert πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 271 KB

One way of using a computer algebra system to do research in finite geometry is to use the system to construct "small" order examples of various constructions, and then hope to recognize a pattern that can be generalized and eventually proven. Of course, initially one does not know if the "small" or