Return to minimal-test.k CVS log | Up to [local] / OpenXM / src / k097 / lib / minimal |
version 1.18, 2000/08/21 07:45:22 | version 1.20, 2000/08/22 05:34:06 | ||
---|---|---|---|
|
|
||
/* $OpenXM: OpenXM/src/k097/lib/minimal/minimal-test.k,v 1.17 2000/08/10 02:59:08 takayama Exp $ */ | /* $OpenXM: OpenXM/src/k097/lib/minimal/minimal-test.k,v 1.19 2000/08/22 02:13:51 takayama Exp $ */ | ||
load["minimal.k"]; | load["minimal.k"]; | ||
def sm1_resol1(p) { | def sm1_resol1(p) { | ||
sm1(" p resol1 /FunctionValue set "); | sm1(" p resol1 /FunctionValue set "); | ||
|
|
||
Println("The dimensions of linear spaces -----"); | Println("The dimensions of linear spaces -----"); | ||
/* sss is the SgetShifts of the Schreyer resol. */ | /* sss is the SgetShifts of the Schreyer resol. */ | ||
sss=[ [ 0 ] , [ 2 , 2 , 2 , 2 , 2 , 2 , 2 , 3 , 3 , 2 , 1 , 3 , 2 ] , [ 1 , 1 , 1 , 2 , 3 , 2 , 2 , 2 , 2 , 2 , 2 , 3 , 2 , 2 , 2 , 3 , 2 , 3 , 3 , 3 , 4 , 3 , 3 , 4 , 3 , 3 , 4 , 3 , 3 , 4 , 4 , 4 , 4 , 4 , 5 , 4 , 4 , 3 , 5 , 5 , 5 , 5 , 4 ] , [ 1 , 3 , 1 , 3 , 3 , 1 , 2 , 2 , 3 , 2 , 3 , 2 , 3 , 5 , 4 , 4 , 3 , 6 , 5 , 4 , 3 , 2 , 3 , 3 , 5 , 4 , 3 , 2 , 4 , 4 , 4 , 4 , 5 , 3 , 2 , 3 , 3 , 4 , 4 , 4 , 5 , 4 , 4 , 5 , 3 , 5 , 4 , 5 , 5 , 6 ] , [ 3 , 1 , 4 , 5 , 4 , 5 , 2 , 3 , 2 , 4 , 3 , 4 , 3 , 3 , 2 , 4 , 3 , 5 , 4 , 5 , 6 ] , [ 2 , 3 ] ] ; | sss=[ [ 0 ] , [ 2 , 2 , 2 , 2 , 2 , 2 , 2 , 3 , 3 , 2 , 1 , 3 , 2 ] , [ 1 , 1 , 1 , 2 , 3 , 2 , 2 , 2 , 2 , 2 , 2 , 3 , 2 , 2 , 2 , 3 , 2 , 3 , 3 , 3 , 4 , 3 , 3 , 4 , 3 , 3 , 4 , 3 , 3 , 4 , 4 , 4 , 4 , 4 , 5 , 4 , 4 , 3 , 5 , 5 , 5 , 5 , 4 ] , [ 1 , 3 , 1 , 3 , 3 , 1 , 2 , 2 , 3 , 2 , 3 , 2 , 3 , 5 , 4 , 4 , 3 , 6 , 5 , 4 , 3 , 2 , 3 , 3 , 5 , 4 , 3 , 2 , 4 , 4 , 4 , 4 , 5 , 3 , 2 , 3 , 3 , 4 , 4 , 4 , 5 , 4 , 4 , 5 , 3 , 5 , 4 , 5 , 5 , 6 ] , [ 3 , 1 , 4 , 5 , 4 , 5 , 2 , 3 , 2 , 4 , 3 , 4 , 3 , 3 , 2 , 4 , 3 , 5 , 4 , 5 , 6 ] , [ 2 , 3 ] ] ; | ||
maxR = 2; /* Maximal root of the b-function. */ | maxR = 3; /* Maximal root of the b-function. */ | ||
n = Length(sss); | n = Length(sss); | ||
euler = 0; | euler = 0; | ||
for (i=0; i<n; i++) { | for (i=0; i<n; i++) { | ||
ttt = sss[i]; | ttt = sss[i]; | ||
ans = 0; | ans = 0; | ||
for (j=0; j<Length(ttt); j++) { | for (j=0; j<Length(ttt); j++) { | ||
p = ttt[j] + maxR + 3; /* degree */ | p = -ttt[j] + maxR + 3; /* degree */ | ||
if (p >= 0) { | if (p-maxR >= 0) { | ||
ans = ans + CancelNumber(p*(p-1)*(p-2)/(3*2*1)); | ans = ans + CancelNumber(p*(p-1)*(p-2)/(3*2*1)); | ||
/* Add the number of monomials */ | /* Add the number of monomials */ | ||
} | } | ||
|
|
||
Println("The dimensions of linear spaces -----"); | Println("The dimensions of linear spaces -----"); | ||
/* sss is the SgetShifts of the minimal resol. */ | /* sss is the SgetShifts of the minimal resol. */ | ||
sss= [ [ 0 ] , [ 2 , 2 , 2 , 2 , 2 , 2 , 2 ] , [ 1 , 2 , 2 , 2 , 2 , 3 , 4 , 4 , 4 , 4 ] , [ 1 , 3 , 4 , 6 ] ]; | sss= [ [ 0 ] , [ 2 , 2 , 2 , 2 , 2 , 2 , 2 ] , [ 1 , 2 , 2 , 2 , 2 , 3 , 4 , 4 , 4 , 4 ] , [ 1 , 3 , 4 , 6 ] ]; | ||
maxR = 2; /* Maximal root of the b-function. */ | maxR = 3; /* Maximal root of the b-function. */ | ||
n = Length(sss); | n = Length(sss); | ||
euler = 0; | euler = 0; | ||
for (i=0; i<n; i++) { | for (i=0; i<n; i++) { | ||
ttt = sss[i]; | ttt = sss[i]; | ||
ans = 0; | ans = 0; | ||
for (j=0; j<Length(ttt); j++) { | for (j=0; j<Length(ttt); j++) { | ||
p = ttt[j] + maxR + 3; /* degree */ | p = -ttt[j] + maxR + 3; /* degree */ | ||
if (p >= 0) { | if (p-maxR >= 0) { | ||
ans = ans + CancelNumber(p*(p-1)*(p-2)/(3*2*1)); | ans = ans + CancelNumber(p*(p-1)*(p-2)/(3*2*1)); | ||
/* Add the number of monomials */ | /* Add the number of monomials */ | ||
} | } |