Open jakobkroeker opened 9 years ago
option(redSB); LIB "primdec.lib"; ring rng = (integer),(x,y,z),(lp(2),lp(1),C); ideal I = 115*x*y*z^2-67*y^2*z^2,-107*x*y*z^2-10*y^2-148*z; ideal J = 146*z^3-46*z^2+78*z-93,-119*x^2*y-105*x*y*z; intersect(I,J);
M2 code:
R = ZZ[x,y,z] I = ideal { 115*x*y*z^2-67*y^2*z^2, -107*x*y*z^2-10*y^2-148*z } J = ideal { 146*z^3-46*z^2+78*z-93, -119*x^2*y-105*x*y*z } IJ = intersect(I,J);
can you reproduce this?
more examples:
option(redSB); LIB "primdec.lib"; ring rng = (integer),(x,y,z),(lp(2),lp(1),C); ideal I = 97*x*z+68*y^2,-121*x^3*z-105*y; ideal J = 132*x*y^2+123*x*z+129*z^2-6,57*x^2+72*x*y; intersect(I,J);
no segfault but examples run for ever - strategy should be improved! M2 does this in a couple of minutes. Preinteger check does not give us anything.
M2 code:
can you reproduce this?
more examples: