Macaulay computer algebra system
From Wikipedia, the free encyclopedia
Macaulay is a computer algebra system for doing polynomial computations, particularly Gröbner basis calculations. Macaulay is designed for solving problems in commutative algebra and algebraic geometry.
It is named after F.S. Macaulay, who worked in elimination theory.
Macaulay was developed by Dave Bayer and Mike Stillman and was later revised by Dan Grayson and Mike Stillman. It is freely available for Macintosh, Linux, and Windows.
In a 2006 interview, Andrei Okounkov cited Macaulay2 along with TeX as examples of successful open source projects used in mathematics. [1]
[edit] References
- ^ Muñoz, Vicente; Persson, Ulf (2006), "Interviews with three Fields medallists", European Mathematical Society Newsletter (62):32-36
- Schenck, Hal (2003). Computational Algebraic Geometry. Cambridge: Cambridge University Press. ISBN 0-521-53650-2. An introduction using Macaulay2.
- Eisenbud, David (2002). Computations in Algebraic Geometry with Macaulay 2. New York: Springer. ISBN 3-540-42230-7. See also on-line version at Dan Grayson's home page. A collection of more advanced articles on the uses of Macaulay2 in algebraic geometry and enumerative combinatorics.
[edit] External links
- The Macaulay2 homepage
- Computations in algebraic geometry with Macaulay 2, a book with full text available online.