SINGULAR procedure for computing the generic initial ideal

[seelisch]

to be discussed; can currently be computed, e.g. like that (proposed by Victor):

LIB "random.lib"; LIB "poly.lib"; proc gin(ideal I) { matrix M = randommat(1,nvars(basering), maxideal(1), 1000); the random coeffs will be in range [-1000,1000] ideal m = ideal(M); map F = basering, m; ideal J = F(I); J = groebner(J); J = normalize(lead(J)); return(J); }

...then call, e.g. for reverse lex ordering: ring r = 0,(a,b,c,d),dp; ideal I = a^3+c2*d, b^3-a*d2; gin(I);