version 1.15, 2000/06/14 07:44:05 |
version 1.17, 2000/07/26 12:56:36 |
|
|
/* $OpenXM: OpenXM/src/k097/lib/minimal/minimal.k,v 1.14 2000/06/09 08:04:54 takayama Exp $ */ |
/* $OpenXM: OpenXM/src/k097/lib/minimal/minimal.k,v 1.16 2000/06/15 07:38:36 takayama Exp $ */ |
#define DEBUG 1 |
#define DEBUG 1 |
/* #define ORDINARY 1 */ |
/* #define ORDINARY 1 */ |
/* If you run this program on openxm version 1.1.2 (FreeBSD), |
/* If you run this program on openxm version 1.1.2 (FreeBSD), |
Line 380 def Sdegree(f,tower,level) { |
|
Line 380 def Sdegree(f,tower,level) { |
|
|
|
def SgenerateTable(tower) { |
def SgenerateTable(tower) { |
local height, n,i,j, ans, ans_at_each_floor; |
local height, n,i,j, ans, ans_at_each_floor; |
|
|
|
/* |
|
Print("SgenerateTable: tower=");Println(tower); |
|
sm1(" print_switch_status "); */ |
height = Length(tower); |
height = Length(tower); |
ans = NewArray(height); |
ans = NewArray(height); |
for (i=0; i<height; i++) { |
for (i=0; i<height; i++) { |
Line 468 def SlaScala(g,opt) { |
|
Line 472 def SlaScala(g,opt) { |
|
Print("rf="); sm1_pmat(rf); |
Print("rf="); sm1_pmat(rf); |
redundant_seq = 1; redundant_seq_ordinary = 1; |
redundant_seq = 1; redundant_seq_ordinary = 1; |
tower = rf[1]; |
tower = rf[1]; |
|
|
|
Println("Generating reduction table which gives an order of reduction."); |
|
Print("WeghtOfSweyl="); Println(WeightOfSweyl); |
|
Print("tower"); Println(tower); |
reductionTable = SgenerateTable(tower); |
reductionTable = SgenerateTable(tower); |
|
Print("reductionTable="); sm1_pmat(reductionTable); |
|
|
skel = rf[2]; |
skel = rf[2]; |
redundantTable = SnewArrayOfFormat(rf[1]); |
redundantTable = SnewArrayOfFormat(rf[1]); |
redundantTable_ordinary = SnewArrayOfFormat(rf[1]); |
redundantTable_ordinary = SnewArrayOfFormat(rf[1]); |
Line 489 def SlaScala(g,opt) { |
|
Line 499 def SlaScala(g,opt) { |
|
Println([level,i]); |
Println([level,i]); |
reductionTable_tmp[i] = -200000; |
reductionTable_tmp[i] = -200000; |
if (reductionTable[level,i] == strategy) { |
if (reductionTable[level,i] == strategy) { |
Print("Processing "); Print([level,i]); |
Print("Processing [level,i]= "); Print([level,i]); |
Print(" Strategy = "); Println(strategy); |
Print(" Strategy = "); Println(strategy); |
if (level == 0) { |
if (level == 0) { |
if (IsNull(redundantTable[level,i])) { |
if (IsNull(redundantTable[level,i])) { |
Line 557 def SlaScala(g,opt) { |
|
Line 567 def SlaScala(g,opt) { |
|
bases = Sbases_to_vec(bases,bettiTable[i]); |
bases = Sbases_to_vec(bases,bettiTable[i]); |
freeResV[i] = bases; |
freeResV[i] = bases; |
} |
} |
return([freeResV, redundantTable,reducer,bettiTable,redundantTable_ordinary]); |
return([freeResV, redundantTable,reducer,bettiTable,redundantTable_ordinary,rf]); |
} |
} |
|
|
def SthereIs(reductionTable_tmp,strategy) { |
def SthereIs(reductionTable_tmp,strategy) { |
Line 895 def Sminimal(g,opt) { |
|
Line 905 def Sminimal(g,opt) { |
|
local r, freeRes, redundantTable, reducer, maxLevel, |
local r, freeRes, redundantTable, reducer, maxLevel, |
minRes, seq, maxSeq, level, betti, q, bases, dr, |
minRes, seq, maxSeq, level, betti, q, bases, dr, |
betti_levelplus, newbases, i, j,qq, tminRes; |
betti_levelplus, newbases, i, j,qq, tminRes; |
|
if (Length(Arglist) < 2) { |
|
opt = null; |
|
} |
|
ScheckIfSchreyer("Sminimal:0"); |
r = SlaScala(g,opt); |
r = SlaScala(g,opt); |
/* Should I turn off the tower?? */ |
/* Should I turn off the tower?? */ |
|
ScheckIfSchreyer("Sminimal:1"); |
freeRes = r[0]; |
freeRes = r[0]; |
redundantTable = r[1]; |
redundantTable = r[1]; |
reducer = r[2]; |
reducer = r[2]; |
Line 954 def Sminimal(g,opt) { |
|
Line 969 def Sminimal(g,opt) { |
|
} |
} |
tminRes = Stetris(minRes,redundantTable); |
tminRes = Stetris(minRes,redundantTable); |
return([SpruneZeroRow(tminRes), tminRes, |
return([SpruneZeroRow(tminRes), tminRes, |
[ minRes, redundantTable, reducer,r[3],r[4]],r[0]]); |
[ minRes, redundantTable, reducer,r[3],r[4]],r[0],r[5]]); |
/* r[4] is the redundantTable_ordinary */ |
/* r[4] is the redundantTable_ordinary */ |
/* r[0] is the freeResolution */ |
/* r[0] is the freeResolution */ |
|
/* r[5] is the skelton */ |
} |
} |
|
|
|
|
Line 1185 def Sschreyer(g) { |
|
Line 1201 def Sschreyer(g) { |
|
rf = SresolutionFrameWithTower(g); |
rf = SresolutionFrameWithTower(g); |
redundant_seq = 1; redundant_seq_ordinary = 1; |
redundant_seq = 1; redundant_seq_ordinary = 1; |
tower = rf[1]; |
tower = rf[1]; |
|
Println("Generating reduction table which gives an order of reduction."); |
|
Println("But, you are in Sschreyer...., you may not use LaScala-Stillman"); |
|
Print("WeghtOfSweyl="); Println(WeightOfSweyl); |
|
Print("tower"); Println(tower); |
reductionTable = SgenerateTable(tower); |
reductionTable = SgenerateTable(tower); |
skel = rf[2]; |
skel = rf[2]; |
redundantTable = SnewArrayOfFormat(rf[1]); |
redundantTable = SnewArrayOfFormat(rf[1]); |
Line 1748 HelpAdd(["ReParse", |
|
Line 1768 HelpAdd(["ReParse", |
|
"In this case, ReParse the outputs from these functions.", |
"In this case, ReParse the outputs from these functions.", |
"cf. IsExaxt_h" |
"cf. IsExaxt_h" |
]]); |
]]); |
|
|
|
def ScheckIfSchreyer(s) { |
|
local ss; |
|
sm1(" (report) (grade) switch_function /ss set "); |
|
if (ss != "module1v") { |
|
Print("ScheckIfSchreyer: from "); Println(s); |
|
Error("grade is not module1v"); |
|
} |
|
/* |
|
sm1(" (report) (mmLarger) switch_function /ss set "); |
|
if (ss != "tower") { |
|
Print("ScheckIfSchreyer: from "); Println(s); |
|
Error("mmLarger is not tower"); |
|
} |
|
*/ |
|
sm1(" [(Schreyer)] system_variable (universalNumber) dc /ss set "); |
|
if (ss != 1) { |
|
Print("ScheckIfSchreyer: from "); Println(s); |
|
Error("Schreyer order is not set."); |
|
} |
|
/* More check will be necessary. */ |
|
return(true); |
|
} |
|
|