@Markiyan Hirnyk 

how to calculate for module case

M := [[x*y,y,x],[x^2+x,y+x^2,y],[-y,x,y],[x^2,x,y]];

i find maple help using regular chain library, but it has ideal source and ideal target,

when compare with singular, seems different, i am not sure singular code whether correct or not.

so, would like to ask how to do this in maple

if you know singular, i would like to know too.

ring r = 32003, (x,y), lp;
setring r;
ideal Z;
ideal i = x-x2-2*x*y+2*x2*y-2*x*y2+y+y2, 1-x2-2*x*y+2*x2*y-2*x*y2+y2;
map phi = r, i;
ideal i1 = preimage(r,phi,Z);
i1;
ideal i2 = preimage(r,i,i);
i2;
ideal i3 = preimage(r,i,Z);
i3;
ideal i4 = preimage(r,Z,i);
i4;

would like to apply to find Cohen Maculay

While(NewKer <> 0)

Mapping = Basis(M – N) ^ K[M]

NewKer = ker(Mapping, M, N)

N = M

M = NewKer

If IsCM(NewKer) = true then

    NewKer

End if

Do

follow Computing non-commutative Groebner bases and Groebner bases for modules

in maple 12

Error, (in Groebner:-Basis) the first argument must be a list or set of polynomials or a PolynomialIdeal

then i find in maple 15 help file is changed from module M := [seq(Vector(subsop(i+1 = 1, [F[i], 0, 0, 0])), i = 1 .. 3)]

to array M := [seq( s^3*F[i] + s^(3-i), i=1..3)];

though it can run, but when apply other example can not run

such as

restart;
with(Groebner):
F := [2*x^2+3*y+z^2, x^2*z^2+z+2*x, x^4*y^7+3*x];
M := [seq( s^3*F[i] + s^(3-i), i=1..3)];
with(Ore_algebra);
A := poly_algebra(x,y,z,s);
T := MonomialOrder(A, lexdeg([s], [x,y,z]), {s});
G := Groebner[Basis](M, T);
Error, (in Groebner:-Basis) the first argument must be a list or set of polynomials or a PolynomialIdeal

G1 := select(proc(a) evalb(degree(a,s)=3) end proc, G);
[seq(Vector([seq(coeff(j,s,3-i), i=0..3)]), j=G1)];
C := Matrix([seq([seq(coeff(j,s,3-i), i=1..3)], j=G1)]);
GB := map(expand, convert(C.Vector(F), list));
Groebner[Basis](F, tdeg(x,y,z));

follow Computing non-commutative Groebner bases and Groebner bases for modules

using LeadingMonomials(f, lexdeg([s],[x,y]));

f:=[y^2+2*x^2*y, y^2];
f1:=[x+y^2,x];
f2:=[x,y];

g:=[f1,f2];

LeadingMonomial(g[1], lexdeg([s],[x,y]));
LeadingMonomial(g[2], lexdeg([s],[x,y]));
LeadingMonomial(g[1], lexdeg([s],[y,x]));
LeadingMonomial(g[2], lexdeg([s],[y,x]));

no result is (0,y^2)

where is wrong?

[x+p*y, x+y, y+z] would like to filter with indets([x+y,y+z])

so that that the list remove polynomials which contain variable p