I tried computing the minimal primes of a fairly complex ideal using the online Macauley2 interface. I start by letting R=QQ[z] and I=ideal(z^6-1) and work over the polynomial ring
S=R/I[x0,x1,x2,y0,y1,y2]
I want $z=e^{i\pi/3}$ to be the sixth root of unity. I have the following ideal of $S$:
J=ideal(((x0+x1)*(x0+x2)*(x1+x2)-8*x0*x1*x2)*(x0*(x1^2-x2^2)+(z^2)*x1*(x2^2-x0^2)+(z^4)*x2*(x0^2-x1^2))*y0-(x1-x2)*(x2-x0)*(x0-x1)*(x0+(z^4)*x1+(z^2)*x2)*(x1*x2+(z^4)*x0*x2+(z^2)*x0*x1)*y1, (x0*(x1^2-x2^2)+(z^4)*x1*(x2^2-x0^2)+(z^2)*x2*(x0^2-x1^2))*(x0+(z^4)*x1+(z^2)*x2)*(x1*x2+(z^4)*x0*x2+(z^2)*x0*x1)*y1-(x0*(x1^2-x2^2)+(z^2)*x1*(x2^2-x0^2)+(z^4)*x2*(x0^2-x1^2))*(x0+(z^2)*x1+(z^4)*x2)*(x1*x2+(z^2)*x0*x2+(z^4)*x0*x1)*y2, (x1-x2)*(x2-x0)*(x0-x1)*(x0+(z^2)*x1+(z^4)*x2)*(x1*x2+(z^2)*x0*x2+(z^4)*x0*x1)*y2-((x0+x1)*(x0+x2)*(x1+x2)-8*x0*x1*x2)*(x0*(x1^2-x2^2)+(z^4)*x1*(x2^2-x0^2)+(z^2)*x2*(x0^2-x1^2))*y0, (x0+x1)*(x0+x2)*(x1+x2)*((y0+y1)*(y0+y2)*(y1+y2)-8*y0*y1*y2)-((x0*x1*x2)*(y0+y1+y2)*(y0*y1+y0*y2+y1*y2)))
I tried using minimalPrimes J, but the program wouldn't output a result, after working for 30+ minutes. Same for primeDecomposition J.
This is a complicated ideal, but I feel like it shouldn't be too crazy for a computer to handle.
Can anyone get this simple code to run easily? Is it possibly because I was using the web interface of Macauley2? If not, are there any simplifications I can make, or more efficient ways of computing the primes of this ideal?
time gens gb J;-- used 14.2537 secondstime minimalPrimes J-- used 16.5552 secondstoString ooHardware Overview:Model Name: MacBook Pro Processor Name: Intel Core i7 Processor Speed: 2,7 GHz Number of Processors: 1 Total Number of Cores: 4Macaulay2, version 1.13