66 lines
1.3 KiB
C
66 lines
1.3 KiB
C
LIB"AeCodPruebas.lib";
|
|
|
|
/*ring r = 0,(x(1..5)),ds;
|
|
|
|
ideal f = x(3),x(4),x(5),x(2)*x(1),x(1)^3+x(2)^3+x(3)*x(1)+x(4)*x(2)+(-x(5)-x(5)^2)*x(1)^2 +x(5)*x(2)^2;
|
|
*/
|
|
|
|
|
|
/*
|
|
ring r = 0,(x,y),ds;
|
|
ideal f = x,xy+y6+y9;
|
|
*/
|
|
|
|
//def Q = MalgrRing(ideal(0),2,f);
|
|
|
|
//breakpoint(AeDeterminacyTestDP);
|
|
|
|
"---";
|
|
//int a = AeDeterminacyTestDP(f);
|
|
//a;
|
|
"---";
|
|
/*
|
|
ring r = 0,(u,v,y,z),ds;
|
|
ideal f = u,v,y,z3-y2z,uz+vz2+yuz5;
|
|
*/
|
|
ring r = 0,(x(1..6),y,z),ds;
|
|
|
|
ideal f = x(1..6),y,z5+y2z3+x(4)*z3+x(5)*z2+x(6)*z, x(1)*z+x(2)*z2+x(3)*z3+x(4)*z4;
|
|
matrix jf = jacob(f);
|
|
|
|
int p = ncols(f);
|
|
int n = nvars(basering);
|
|
|
|
def Q = MalgrRing(ideal(0),n,f);
|
|
setring Q;
|
|
def f = imap(r,f);
|
|
def jf = imap(r, jf);
|
|
module wf = freemodule(9);
|
|
int i;
|
|
int m = ncols(Gens);
|
|
if (p > n)
|
|
{
|
|
ideal h = ideal(f[(n+1)..p]);
|
|
//print("h=");h;//
|
|
for (i=1; i <= m-1; i++)
|
|
{
|
|
wf = wf + (freemodule(p) * (h)^i);
|
|
//print("wf=");wf;//
|
|
}
|
|
}
|
|
"Generando modulos .....";
|
|
module TAef = GenerateOYModule(jf,wf);
|
|
"Modulo Tae generado";
|
|
module Maxi6 = GenerateOYModule(maxideal(6)*freemodule(9), 0);
|
|
"Modulo Maxi Generado";
|
|
ring target = 0,(X(1..n)),ds;
|
|
module TAef = imap(Q,TAef);
|
|
module Maxi6 = imap(Q, Maxi6);
|
|
"Calculando base std...";
|
|
module B = std(TAef + Maxi6);
|
|
"Calculando kbase....";
|
|
kbase(std(TAef + Maxi6));
|
|
|
|
//AeDeterminacyTestDP(f);
|
|
//AeNormal(f);
|
|
quit; |