I would like to know what code 137 is.
--------------------------------------------------------------------------------------------------------
Let me ask about it in the following form.
Maybe about a decade ago I complained that the code:
R=QQ[y,x];
I=ideal(y^12+y^11+y^10*x^2+y^8*x^9+x^31);
A=R/I;
time icf=icFractions(A);
would never finish running, so would never give any answer
(whereas, Singular would run
> LIB "normal.lib";
> ring r=0,(y,x),dp;
> ideal i=y12+y11+y10x2+y8x9+x31;
> list nor=normal(i);nor;
in about 3 seconds.)
But if I start with GC_INITIAL_HEAP_SIZE=150G, it will use about 10G and 5 minutes before killing itself and producing the code 137. Can anyone explain this to me?
Doug Leonard