Macaulay is a system for computation in algebraic geometry and commutative algebra. Currently, Macaulay is one of the few systems that require little space and time to compute a Groebner basis of any system of polynomial equations.
Dave Bayer Mike Stillman
Department of Mathematics Department of Mathematics
Columbia University Cornell University
New York, NY 10027 Ithaca, NY 14853
(212)854-2643, 864-4235 (607)255-7240, 257-5320
dab@math.columbia.edu mike@math.cornell.edu
Version 3.0 has been implemented on the Macintosh, PC, and Unix
platforms. Macaulay is public domain software and the latest version of the
computer algebra package can be obtained by anonymous ftp at
math.harvard.edu.
Macaulay differs in a number of significant ways from other computer algebra systems. The computation of standard bases is its fundamental operation, rather than simplification and factoring. Unlike other systems which provide for the computation of standard bases, submodules of free modules can uniformly be used wherever ideals can be used. Macaulay offers a modest level of programmability. Currently, Macaulay is one of the few systems that require little space and time to compute a Groebner basis of any system of polynomial equations. However, a drawback is that only finite fields are allowed.