Update: This challenge problem was recently (Summer 2005) solved independently by Raymond Hemmecke and Peter Malkin math.CO/0508359 and Niels Lauritzen math.AC/0508287. Please read these preprints to find out more.
Computational
Commutative Algebra Challenge Problem
Can you compute a reduced revlex Groebner basis of the ideal generated
by the 145512 binomials described below? How long does your computation
take? Are the terms of each binomial in the output relatively prime?
Please read the following note, "About this Problem" to find out
more information about this problem.
-
About this Problem: PS
-
14 Representative Binomials (CoCoA Format): txt
-
14 Representative Binomials (Macaulay2 and Singular Format): txt
-
104040 Binomials (CoCoA Format, gzipped): zp
-
104040 Binomials (Macaulay2 and Singular Format, gzipped): zp
-
41472 More Binomials* (CoCoA Format, gzipped): zp
-
41472 More Binomials* (Macaulay2 and Singular Format, gzipped): zp
* Thanks to Satoshi Aoki, University of Tokyo, for alerting us to
these binomials, which we missed.