| 1 | initial version |
lex order is typically slow when it comes to Groebner basis computation. Changing order = 'lex(11),lex(5)' to order = 'degrevlex(11),degrevlex(5)' makes your code complete within a few seconds.
PS. Perhaps, in Macaulay2 computation you also used some graded order, but if it were lexicographic one, it'd helpful to see the actual code.
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.