| version 1.20, 2002/01/29 05:37:12 |
version 1.22, 2003/04/20 08:54:28 |
|
|
| * DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
* DEVELOPER SHALL HAVE NO LIABILITY IN CONNECTION WITH THE USE, |
| * PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
* PERFORMANCE OR NON-PERFORMANCE OF THE SOFTWARE. |
| * |
* |
| * $OpenXM: OpenXM_contrib2/asir2000/lib/bfct,v 1.19 2002/01/29 02:03:41 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/lib/bfct,v 1.21 2002/01/30 02:12:58 noro Exp $ |
| */ |
*/ |
| /* requires 'primdec' */ |
/* requires 'primdec' */ |
| |
|
| |
extern LIBRARY_GR_LOADED$ |
| |
extern LIBRARY_PRIMDEC_LOADED$ |
| |
|
| |
if(!LIBRARY_GR_LOADED) load("gr"); else ; LIBRARY_GR_LOADED = 1$ |
| |
if(!LIBRARY_PRIMDEC_LOADED) load("primdec"); else ; LIBRARY_PRIMDEC_LOADED = 1$ |
| |
|
| |
/* toplevel */ |
| |
|
| |
def bfunction(F) |
| |
{ |
| |
V = vars(F); |
| |
N = length(V); |
| |
D = newvect(N); |
| |
|
| |
for ( I = 0; I < N; I++ ) |
| |
D[I] = [deg(F,V[I]),V[I]]; |
| |
qsort(D,compare_first); |
| |
for ( V = [], I = 0; I < N; I++ ) |
| |
V = cons(D[I][1],V); |
| |
return bfct_via_gbfct_weight(F,V); |
| |
} |
| |
|
| /* annihilating ideal of F^s */ |
/* annihilating ideal of F^s */ |
| |
|
| def ann(F) |
def ann(F) |
| Line 249 def generic_bfct(F,V,DV,W) |
|
| Line 271 def generic_bfct(F,V,DV,W) |
|
| FH = map(dp_dtop,map(dp_homo,map(dp_ptod,F,VDV)),VDVH); |
FH = map(dp_dtop,map(dp_homo,map(dp_ptod,F,VDV)),VDVH); |
| |
|
| /* compute a groebner basis of FH w.r.t. MWH */ |
/* compute a groebner basis of FH w.r.t. MWH */ |
| dp_gr_flags(["Top",1]); |
dp_gr_flags(["Top",1,"NoRA",1]); |
| GH = dp_weyl_gr_main(FH,VDVH,0,1,11); |
GH = dp_weyl_gr_main(FH,VDVH,0,1,11); |
| dp_gr_flags(["Top",0]); |
dp_gr_flags(["Top",0,"NoRA",0]); |
| |
|
| /* dehomigenize GH */ |
/* dehomigenize GH */ |
| G = map(subst,GH,h,1); |
G = map(subst,GH,h,1); |
| Line 410 def bfct_via_gbfct(F) |
|
| Line 432 def bfct_via_gbfct(F) |
|
| V1 = cons(t,V); DV1 = cons(dt,DV); |
V1 = cons(t,V); DV1 = cons(dt,DV); |
| W = newvect(N+1); |
W = newvect(N+1); |
| W[0] = 1; |
W[0] = 1; |
| R = generic_bfct_1(B,V1,DV1,W); |
R = generic_bfct(B,V1,DV1,W); |
| |
|
| return subst(R,s,-s-1); |
return subst(R,s,-s-1); |
| } |
} |
| Line 484 def bfct_via_gbfct_weight_1(F,V) |
|
| Line 506 def bfct_via_gbfct_weight_1(F,V) |
|
| V1 = append(V,[t]); DV1 = append(DV,[dt]); |
V1 = append(V,[t]); DV1 = append(DV,[dt]); |
| W = newvect(N+1); |
W = newvect(N+1); |
| W[N] = 1; |
W[N] = 1; |
| R = generic_bfct(B,V1,DV1,W); |
R = generic_bfct_1(B,V1,DV1,W); |
| dp_set_weight(0); |
dp_set_weight(0); |
| return subst(R,s,-s-1); |
return subst(R,s,-s-1); |
| } |
} |