version 1.9, 2000/12/08 02:39:05 |
version 1.29, 2003/04/21 02:49:40 |
|
|
* 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/builtin/dp.c,v 1.8 2000/12/05 06:59:15 noro Exp $ |
* $OpenXM: OpenXM_contrib2/asir2000/builtin/dp.c,v 1.28 2003/01/15 04:53:03 noro Exp $ |
*/ |
*/ |
#include "ca.h" |
#include "ca.h" |
#include "base.h" |
#include "base.h" |
#include "parse.h" |
#include "parse.h" |
|
|
extern int dp_fcoeffs; |
|
extern int dp_nelim; |
extern int dp_nelim; |
extern int dp_order_pair_length; |
extern int dp_order_pair_length; |
extern struct order_pair *dp_order_pair; |
extern struct order_pair *dp_order_pair; |
extern struct order_spec dp_current_spec; |
extern struct order_spec dp_current_spec; |
|
|
|
int do_weyl; |
|
|
void Pdp_ord(), Pdp_ptod(), Pdp_dtop(); |
void Pdp_ord(), Pdp_ptod(), Pdp_dtop(); |
void Pdp_ptozp(), Pdp_ptozp2(), Pdp_red(), Pdp_red2(), Pdp_lcm(), Pdp_redble(); |
void Pdp_ptozp(), Pdp_ptozp2(), Pdp_red(), Pdp_red2(), Pdp_lcm(), Pdp_redble(); |
Line 68 void Pdp_nf_mod(),Pdp_true_nf_mod(); |
|
Line 68 void Pdp_nf_mod(),Pdp_true_nf_mod(); |
|
void Pdp_criB(),Pdp_nelim(); |
void Pdp_criB(),Pdp_nelim(); |
void Pdp_minp(),Pdp_sp_mod(); |
void Pdp_minp(),Pdp_sp_mod(); |
void Pdp_homo(),Pdp_dehomo(); |
void Pdp_homo(),Pdp_dehomo(); |
void Pdp_gr_mod_main(); |
void Pdp_gr_mod_main(),Pdp_gr_f_main(); |
void Pdp_gr_main(),Pdp_gr_hm_main(),Pdp_gr_d_main(),Pdp_gr_flags(); |
void Pdp_gr_main(),Pdp_gr_hm_main(),Pdp_gr_d_main(),Pdp_gr_flags(); |
void Pdp_f4_main(),Pdp_f4_mod_main(); |
void Pdp_f4_main(),Pdp_f4_mod_main(),Pdp_f4_f_main(); |
void Pdp_gr_print(); |
void Pdp_gr_print(); |
void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_mdtod(); |
void Pdp_mbase(),Pdp_lnf_mod(),Pdp_nf_tab_mod(),Pdp_mdtod(), Pdp_nf_tab_f(); |
void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), Pdp_sep(); |
void Pdp_vtoe(), Pdp_etov(), Pdp_dtov(), Pdp_idiv(), Pdp_sep(); |
void Pdp_cont(); |
void Pdp_cont(); |
|
void Pdp_gr_checklist(); |
|
|
|
void Pdp_weyl_red(); |
|
void Pdp_weyl_sp(); |
|
void Pdp_weyl_nf(),Pdp_weyl_nf_mod(); |
|
void Pdp_weyl_gr_main(),Pdp_weyl_gr_mod_main(),Pdp_weyl_gr_f_main(); |
|
void Pdp_weyl_f4_main(),Pdp_weyl_f4_mod_main(),Pdp_weyl_f4_f_main(); |
|
void Pdp_weyl_mul(),Pdp_weyl_mul_mod(); |
|
void Pdp_weyl_set_weight(); |
|
void Pdp_set_weight(); |
|
void Pdp_nf_f(),Pdp_weyl_nf_f(); |
|
void Pdp_lnf_f(); |
|
|
|
LIST remove_zero_from_list(LIST); |
|
|
struct ftab dp_tab[] = { |
struct ftab dp_tab[] = { |
/* content reduction */ |
/* content reduction */ |
{"dp_ptozp",Pdp_ptozp,1}, |
{"dp_ptozp",Pdp_ptozp,1}, |
Line 84 struct ftab dp_tab[] = { |
|
Line 98 struct ftab dp_tab[] = { |
|
{"dp_red_coef",Pdp_red_coef,2}, |
{"dp_red_coef",Pdp_red_coef,2}, |
{"dp_cont",Pdp_cont,1}, |
{"dp_cont",Pdp_cont,1}, |
|
|
|
/* polynomial ring */ |
/* s-poly */ |
/* s-poly */ |
{"dp_sp",Pdp_sp,2}, |
{"dp_sp",Pdp_sp,2}, |
{"dp_sp_mod",Pdp_sp_mod,3}, |
{"dp_sp_mod",Pdp_sp_mod,3}, |
Line 94 struct ftab dp_tab[] = { |
|
Line 109 struct ftab dp_tab[] = { |
|
|
|
/* normal form */ |
/* normal form */ |
{"dp_nf",Pdp_nf,4}, |
{"dp_nf",Pdp_nf,4}, |
|
{"dp_nf_f",Pdp_nf_f,4}, |
{"dp_true_nf",Pdp_true_nf,4}, |
{"dp_true_nf",Pdp_true_nf,4}, |
{"dp_nf_mod",Pdp_nf_mod,5}, |
{"dp_nf_mod",Pdp_nf_mod,5}, |
{"dp_true_nf_mod",Pdp_true_nf_mod,5}, |
{"dp_true_nf_mod",Pdp_true_nf_mod,5}, |
{"dp_lnf_mod",Pdp_lnf_mod,3}, |
{"dp_lnf_mod",Pdp_lnf_mod,3}, |
|
{"dp_nf_tab_f",Pdp_nf_tab_f,2}, |
{"dp_nf_tab_mod",Pdp_nf_tab_mod,3}, |
{"dp_nf_tab_mod",Pdp_nf_tab_mod,3}, |
|
{"dp_lnf_f",Pdp_lnf_f,2}, |
|
|
/* Buchberger algorithm */ |
/* Buchberger algorithm */ |
{"dp_gr_main",Pdp_gr_main,5}, |
{"dp_gr_main",Pdp_gr_main,5}, |
{"dp_gr_mod_main",Pdp_gr_mod_main,5}, |
{"dp_gr_mod_main",Pdp_gr_mod_main,5}, |
|
{"dp_gr_f_main",Pdp_gr_f_main,4}, |
|
{"dp_gr_checklist",Pdp_gr_checklist,2}, |
|
|
/* F4 algorithm */ |
/* F4 algorithm */ |
{"dp_f4_main",Pdp_f4_main,3}, |
{"dp_f4_main",Pdp_f4_main,3}, |
{"dp_f4_mod_main",Pdp_f4_mod_main,4}, |
{"dp_f4_mod_main",Pdp_f4_mod_main,4}, |
|
|
|
/* weyl algebra */ |
|
/* multiplication */ |
|
{"dp_weyl_mul",Pdp_weyl_mul,2}, |
|
{"dp_weyl_mul_mod",Pdp_weyl_mul_mod,3}, |
|
|
|
/* s-poly */ |
|
{"dp_weyl_sp",Pdp_weyl_sp,2}, |
|
|
|
/* m-reduction */ |
|
{"dp_weyl_red",Pdp_weyl_red,3}, |
|
|
|
/* normal form */ |
|
{"dp_weyl_nf",Pdp_weyl_nf,4}, |
|
{"dp_weyl_nf_mod",Pdp_weyl_nf_mod,5}, |
|
{"dp_weyl_nf_f",Pdp_weyl_nf_f,4}, |
|
|
|
/* Buchberger algorithm */ |
|
{"dp_weyl_gr_main",Pdp_weyl_gr_main,5}, |
|
{"dp_weyl_gr_mod_main",Pdp_weyl_gr_mod_main,5}, |
|
{"dp_weyl_gr_f_main",Pdp_weyl_gr_f_main,4}, |
|
|
|
/* F4 algorithm */ |
|
{"dp_weyl_f4_main",Pdp_weyl_f4_main,3}, |
|
{"dp_weyl_f4_mod_main",Pdp_weyl_f4_mod_main,4}, |
|
|
|
/* misc */ |
|
{"dp_set_weight",Pdp_set_weight,-1}, |
|
{"dp_weyl_set_weight",Pdp_weyl_set_weight,-1}, |
{0,0,0}, |
{0,0,0}, |
}; |
}; |
|
|
|
|
n = v->len; |
n = v->len; |
NEWDL(dl,n); d = dl->d; |
NEWDL(dl,n); d = dl->d; |
for ( i = 0, td = 0; i < n; i++ ) { |
for ( i = 0, td = 0; i < n; i++ ) { |
d[i] = QTOS((Q)(v->body[i])); td += d[i]; |
d[i] = QTOS((Q)(v->body[i])); td += MUL_WEIGHT(d[i],i); |
} |
} |
dl->td = td; |
dl->td = td; |
NEWMP(m); m->dl = dl; m->c = (P)ONE; NEXT(m) = 0; |
NEWMP(m); m->dl = dl; m->c = (P)ONE; NEXT(m) = 0; |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
|
void Pdp_lnf_f(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
DP r1,r2; |
|
NODE b,g,n; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_lnf_f"); |
|
asir_assert(ARG1(arg),O_LIST,"dp_lnf_f"); |
|
b = BDY((LIST)ARG0(arg)); g = BDY((LIST)ARG1(arg)); |
|
dp_lnf_f((DP)BDY(b),(DP)BDY(NEXT(b)),g,&r1,&r2); |
|
NEWNODE(n); BDY(n) = (pointer)r1; |
|
NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r2; |
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
|
} |
|
|
void Pdp_nf_tab_mod(arg,rp) |
void Pdp_nf_tab_mod(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
|
|
QTOS((Q)ARG2(arg)),rp); |
QTOS((Q)ARG2(arg)),rp); |
} |
} |
|
|
|
void Pdp_nf_tab_f(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
asir_assert(ARG0(arg),O_DP,"dp_nf_tab_f"); |
|
asir_assert(ARG1(arg),O_VECT,"dp_nf_tab_f"); |
|
dp_nf_tab_f((DP)ARG0(arg),(LIST *)BDY((VECT)ARG1(arg)),rp); |
|
} |
|
|
void Pdp_ord(arg,rp) |
void Pdp_ord(arg,rp) |
NODE arg; |
NODE arg; |
Obj *rp; |
Obj *rp; |
|
|
DP *rp; |
DP *rp; |
{ |
{ |
asir_assert(ARG0(arg),O_DP,"dp_ptozp"); |
asir_assert(ARG0(arg),O_DP,"dp_ptozp"); |
if ( Dist ) |
dp_ptozp((DP)ARG0(arg),rp); |
dp_ptozp_d(BDY(Dist),length(BDY(Dist)),(DP)ARG0(arg),rp); |
|
else |
|
dp_ptozp((DP)ARG0(arg),rp); |
|
} |
} |
|
|
void Pdp_ptozp2(arg,rp) |
void Pdp_ptozp2(arg,rp) |
|
|
p0 = (DP)ARG0(arg); p1 = (DP)ARG1(arg); |
p0 = (DP)ARG0(arg); p1 = (DP)ARG1(arg); |
asir_assert(p0,O_DP,"dp_ptozp2"); |
asir_assert(p0,O_DP,"dp_ptozp2"); |
asir_assert(p1,O_DP,"dp_ptozp2"); |
asir_assert(p1,O_DP,"dp_ptozp2"); |
if ( Dist ) |
dp_ptozp2(p0,p1,&h,&r); |
dp_ptozp2_d(BDY(Dist),length(BDY(Dist)),p0,p1,&h,&r); |
|
else |
|
dp_ptozp2(p0,p1,&h,&r); |
|
NEWNODE(n0); BDY(n0) = (pointer)h; |
NEWNODE(n0); BDY(n0) = (pointer)h; |
NEWNODE(NEXT(n0)); BDY(NEXT(n0)) = (pointer)r; |
NEWNODE(NEXT(n0)); BDY(NEXT(n0)) = (pointer)r; |
NEXT(NEXT(n0)) = 0; |
NEXT(NEXT(n0)) = 0; |
|
|
DP g; |
DP g; |
int full; |
int full; |
|
|
|
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_nf"); |
asir_assert(ARG0(arg),O_LIST,"dp_nf"); |
asir_assert(ARG1(arg),O_DP,"dp_nf"); |
asir_assert(ARG1(arg),O_DP,"dp_nf"); |
asir_assert(ARG2(arg),O_VECT,"dp_nf"); |
asir_assert(ARG2(arg),O_VECT,"dp_nf"); |
|
|
} |
} |
b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); |
b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); |
full = (Q)ARG3(arg) ? 1 : 0; |
full = (Q)ARG3(arg) ? 1 : 0; |
dp_nf_ptozp(b,g,ps,full,DP_Multiple,rp); |
dp_nf_z(b,g,ps,full,DP_Multiple,rp); |
} |
} |
|
|
|
void Pdp_weyl_nf(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
NODE b; |
|
DP *ps; |
|
DP g; |
|
int full; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf"); |
|
asir_assert(ARG1(arg),O_DP,"dp_weyl_nf"); |
|
asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf"); |
|
asir_assert(ARG3(arg),O_N,"dp_weyl_nf"); |
|
if ( !(g = (DP)ARG1(arg)) ) { |
|
*rp = 0; return; |
|
} |
|
b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); |
|
full = (Q)ARG3(arg) ? 1 : 0; |
|
do_weyl = 1; |
|
dp_nf_z(b,g,ps,full,DP_Multiple,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
/* nf computation using field operations */ |
|
|
|
void Pdp_nf_f(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
NODE b; |
|
DP *ps; |
|
DP g; |
|
int full; |
|
|
|
do_weyl = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_nf_f"); |
|
asir_assert(ARG1(arg),O_DP,"dp_nf_f"); |
|
asir_assert(ARG2(arg),O_VECT,"dp_nf_f"); |
|
asir_assert(ARG3(arg),O_N,"dp_nf_f"); |
|
if ( !(g = (DP)ARG1(arg)) ) { |
|
*rp = 0; return; |
|
} |
|
b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); |
|
full = (Q)ARG3(arg) ? 1 : 0; |
|
dp_nf_f(b,g,ps,full,rp); |
|
} |
|
|
|
void Pdp_weyl_nf_f(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
NODE b; |
|
DP *ps; |
|
DP g; |
|
int full; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf_f"); |
|
asir_assert(ARG1(arg),O_DP,"dp_weyl_nf_f"); |
|
asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf_f"); |
|
asir_assert(ARG3(arg),O_N,"dp_weyl_nf_f"); |
|
if ( !(g = (DP)ARG1(arg)) ) { |
|
*rp = 0; return; |
|
} |
|
b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); |
|
full = (Q)ARG3(arg) ? 1 : 0; |
|
do_weyl = 1; |
|
dp_nf_f(b,g,ps,full,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
void Pdp_nf_mod(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
NODE b; |
|
DP g; |
|
DP *ps; |
|
int mod,full,ac; |
|
NODE n,n0; |
|
|
|
do_weyl = 0; |
|
ac = argc(arg); |
|
asir_assert(ARG0(arg),O_LIST,"dp_nf_mod"); |
|
asir_assert(ARG1(arg),O_DP,"dp_nf_mod"); |
|
asir_assert(ARG2(arg),O_VECT,"dp_nf_mod"); |
|
asir_assert(ARG3(arg),O_N,"dp_nf_mod"); |
|
asir_assert(ARG4(arg),O_N,"dp_nf_mod"); |
|
if ( !(g = (DP)ARG1(arg)) ) { |
|
*rp = 0; return; |
|
} |
|
b = BDY((LIST)ARG0(arg)); ps = (DP *)BDY((VECT)ARG2(arg)); |
|
full = QTOS((Q)ARG3(arg)); mod = QTOS((Q)ARG4(arg)); |
|
for ( n0 = n = 0; b; b = NEXT(b) ) { |
|
NEXTNODE(n0,n); |
|
BDY(n) = (pointer)QTOS((Q)BDY(b)); |
|
} |
|
if ( n0 ) |
|
NEXT(n) = 0; |
|
dp_nf_mod(n0,g,ps,mod,full,rp); |
|
} |
|
|
void Pdp_true_nf(arg,rp) |
void Pdp_true_nf(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
|
|
P dn; |
P dn; |
int full; |
int full; |
|
|
|
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf"); |
asir_assert(ARG0(arg),O_LIST,"dp_true_nf"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf"); |
asir_assert(ARG1(arg),O_DP,"dp_true_nf"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf"); |
asir_assert(ARG2(arg),O_VECT,"dp_true_nf"); |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_nf_mod(arg,rp) |
void Pdp_weyl_nf_mod(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
{ |
{ |
|
|
NODE n,n0; |
NODE n,n0; |
|
|
ac = argc(arg); |
ac = argc(arg); |
asir_assert(ARG0(arg),O_LIST,"dp_nf_mod"); |
asir_assert(ARG0(arg),O_LIST,"dp_weyl_nf_mod"); |
asir_assert(ARG1(arg),O_DP,"dp_nf_mod"); |
asir_assert(ARG1(arg),O_DP,"dp_weyl_nf_mod"); |
asir_assert(ARG2(arg),O_VECT,"dp_nf_mod"); |
asir_assert(ARG2(arg),O_VECT,"dp_weyl_nf_mod"); |
asir_assert(ARG3(arg),O_N,"dp_nf_mod"); |
asir_assert(ARG3(arg),O_N,"dp_weyl_nf_mod"); |
asir_assert(ARG4(arg),O_N,"dp_nf_mod"); |
asir_assert(ARG4(arg),O_N,"dp_weyl_nf_mod"); |
if ( !(g = (DP)ARG1(arg)) ) { |
if ( !(g = (DP)ARG1(arg)) ) { |
*rp = 0; return; |
*rp = 0; return; |
} |
} |
|
|
} |
} |
if ( n0 ) |
if ( n0 ) |
NEXT(n) = 0; |
NEXT(n) = 0; |
dp_nf_mod(n,g,ps,mod,full,rp); |
do_weyl = 1; |
|
dp_nf_mod(n0,g,ps,mod,full,rp); |
|
do_weyl = 0; |
} |
} |
|
|
void Pdp_true_nf_mod(arg,rp) |
void Pdp_true_nf_mod(arg,rp) |
|
|
int mod,full; |
int mod,full; |
NODE n; |
NODE n; |
|
|
|
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_nf_mod"); |
asir_assert(ARG0(arg),O_LIST,"dp_nf_mod"); |
asir_assert(ARG1(arg),O_DP,"dp_nf_mod"); |
asir_assert(ARG1(arg),O_DP,"dp_nf_mod"); |
asir_assert(ARG2(arg),O_VECT,"dp_nf_mod"); |
asir_assert(ARG2(arg),O_VECT,"dp_nf_mod"); |
|
|
P dmy; |
P dmy; |
NODE n; |
NODE n; |
|
|
|
do_weyl = 0; |
asir_assert(ARG0(arg),O_DP,"dp_red_mod"); |
asir_assert(ARG0(arg),O_DP,"dp_red_mod"); |
asir_assert(ARG1(arg),O_DP,"dp_red_mod"); |
asir_assert(ARG1(arg),O_DP,"dp_red_mod"); |
asir_assert(ARG2(arg),O_DP,"dp_red_mod"); |
asir_assert(ARG2(arg),O_DP,"dp_red_mod"); |
|
|
NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r; |
NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)r; |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
void Pdp_subd(arg,rp) |
void Pdp_subd(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
|
|
dp_subd(p1,p2,rp); |
dp_subd(p1,p2,rp); |
} |
} |
|
|
|
void Pdp_weyl_mul(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
DP p1,p2; |
|
|
|
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
|
asir_assert(p1,O_DP,"dp_weyl_mul"); asir_assert(p2,O_DP,"dp_mul"); |
|
do_weyl = 1; |
|
muld(CO,p1,p2,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
void Pdp_weyl_mul_mod(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
DP p1,p2; |
|
Q m; |
|
|
|
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); m = (Q)ARG2(arg); |
|
asir_assert(p1,O_DP,"dp_weyl_mul_mod"); |
|
asir_assert(p2,O_DP,"dp_mul_mod"); |
|
asir_assert(m,O_N,"dp_mul_mod"); |
|
do_weyl = 1; |
|
mulmd(CO,QTOS(m),p1,p2,rp); |
|
do_weyl = 0; |
|
} |
|
|
void Pdp_red(arg,rp) |
void Pdp_red(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
|
|
DP head,rest,dmy1; |
DP head,rest,dmy1; |
P dmy; |
P dmy; |
|
|
|
do_weyl = 0; |
asir_assert(ARG0(arg),O_DP,"dp_red"); |
asir_assert(ARG0(arg),O_DP,"dp_red"); |
asir_assert(ARG1(arg),O_DP,"dp_red"); |
asir_assert(ARG1(arg),O_DP,"dp_red"); |
asir_assert(ARG2(arg),O_DP,"dp_red"); |
asir_assert(ARG2(arg),O_DP,"dp_red"); |
|
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
} |
} |
|
|
|
void Pdp_weyl_red(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
NODE n; |
|
DP head,rest,dmy1; |
|
P dmy; |
|
|
|
asir_assert(ARG0(arg),O_DP,"dp_weyl_red"); |
|
asir_assert(ARG1(arg),O_DP,"dp_weyl_red"); |
|
asir_assert(ARG2(arg),O_DP,"dp_weyl_red"); |
|
do_weyl = 1; |
|
dp_red((DP)ARG0(arg),(DP)ARG1(arg),(DP)ARG2(arg),&head,&rest,&dmy,&dmy1); |
|
do_weyl = 0; |
|
NEWNODE(n); BDY(n) = (pointer)head; |
|
NEWNODE(NEXT(n)); BDY(NEXT(n)) = (pointer)rest; |
|
NEXT(NEXT(n)) = 0; MKLIST(*rp,n); |
|
} |
|
|
void Pdp_sp(arg,rp) |
void Pdp_sp(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
{ |
{ |
DP p1,p2; |
DP p1,p2; |
|
|
|
do_weyl = 0; |
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
asir_assert(p1,O_DP,"dp_sp"); asir_assert(p2,O_DP,"dp_sp"); |
asir_assert(p1,O_DP,"dp_sp"); asir_assert(p2,O_DP,"dp_sp"); |
dp_sp(p1,p2,rp); |
dp_sp(p1,p2,rp); |
} |
} |
|
|
|
void Pdp_weyl_sp(arg,rp) |
|
NODE arg; |
|
DP *rp; |
|
{ |
|
DP p1,p2; |
|
|
|
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
|
asir_assert(p1,O_DP,"dp_weyl_sp"); asir_assert(p2,O_DP,"dp_sp"); |
|
do_weyl = 1; |
|
dp_sp(p1,p2,rp); |
|
do_weyl = 0; |
|
} |
|
|
void Pdp_sp_mod(arg,rp) |
void Pdp_sp_mod(arg,rp) |
NODE arg; |
NODE arg; |
DP *rp; |
DP *rp; |
|
|
DP p1,p2; |
DP p1,p2; |
int mod; |
int mod; |
|
|
|
do_weyl = 0; |
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
p1 = (DP)ARG0(arg); p2 = (DP)ARG1(arg); |
asir_assert(p1,O_DP,"dp_sp_mod"); asir_assert(p2,O_DP,"dp_sp_mod"); |
asir_assert(p1,O_DP,"dp_sp_mod"); asir_assert(p2,O_DP,"dp_sp_mod"); |
asir_assert(ARG2(arg),O_N,"dp_sp_mod"); |
asir_assert(ARG2(arg),O_N,"dp_sp_mod"); |
|
|
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
n = p1->nv; d1 = BDY(p1)->dl; d2 = BDY(p2)->dl; |
NEWDL(d,n); |
NEWDL(d,n); |
for ( i = 0, td = 0; i < n; i++ ) { |
for ( i = 0, td = 0; i < n; i++ ) { |
d->d[i] = MAX(d1->d[i],d2->d[i]); td += d->d[i]; |
d->d[i] = MAX(d1->d[i],d2->d[i]); td += MUL_WEIGHT(d->d[i],i); |
} |
} |
d->td = td; |
d->td = td; |
NEWMP(m); m->dl = d; m->c = (P)ONE; NEXT(m) = 0; |
NEWMP(m); m->dl = d; m->c = (P)ONE; NEXT(m) = 0; |
|
|
dp_make_flaglist(rp); |
dp_make_flaglist(rp); |
} |
} |
|
|
extern int DP_Print; |
extern int DP_Print, DP_PrintShort; |
|
|
void Pdp_gr_print(arg,rp) |
void Pdp_gr_print(arg,rp) |
NODE arg; |
NODE arg; |
Q *rp; |
Q *rp; |
{ |
{ |
Q q; |
Q q; |
|
int s; |
|
|
if ( arg ) { |
if ( arg ) { |
asir_assert(ARG0(arg),O_N,"dp_gr_print"); |
asir_assert(ARG0(arg),O_N,"dp_gr_print"); |
q = (Q)ARG0(arg); DP_Print = QTOS(q); |
q = (Q)ARG0(arg); |
} else |
s = QTOS(q); |
STOQ(DP_Print,q); |
switch ( s ) { |
|
case 0: |
|
DP_Print = 0; DP_PrintShort = 0; |
|
break; |
|
case 1: |
|
DP_Print = 1; |
|
break; |
|
case 2: default: |
|
DP_Print = 0; DP_PrintShort = 1; |
|
break; |
|
} |
|
} else { |
|
if ( DP_Print ) { |
|
STOQ(1,q); |
|
} else if ( DP_PrintShort ) { |
|
STOQ(2,q); |
|
} else |
|
q = 0; |
|
} |
*rp = q; |
*rp = q; |
} |
} |
|
|
|
|
int modular; |
int modular; |
struct order_spec ord; |
struct order_spec ord; |
|
|
|
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
homo = (Num)ARG2(arg); |
homo = (Num)ARG2(arg); |
m = (Q)ARG3(arg); |
m = (Q)ARG3(arg); |
if ( !m ) |
if ( !m ) |
|
|
else |
else |
modular = QTOS(m); |
modular = QTOS(m); |
create_order_spec(ARG4(arg),&ord); |
create_order_spec(ARG4(arg),&ord); |
dp_gr_main(f,v,homo,modular,&ord,rp); |
dp_gr_main(f,v,homo,modular,0,&ord,rp); |
} |
} |
|
|
|
void Pdp_gr_f_main(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
Num homo; |
|
int m,field,t; |
|
struct order_spec ord; |
|
NODE n; |
|
|
|
do_weyl = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_gr_f_main"); |
|
asir_assert(ARG1(arg),O_LIST,"dp_gr_f_main"); |
|
asir_assert(ARG2(arg),O_N,"dp_gr_f_main"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
homo = (Num)ARG2(arg); |
|
#if 0 |
|
asir_assert(ARG3(arg),O_N,"dp_gr_f_main"); |
|
m = QTOS((Q)ARG3(arg)); |
|
if ( m ) |
|
error("dp_gr_f_main : trace lifting is not implemented yet"); |
|
create_order_spec(ARG4(arg),&ord); |
|
#else |
|
m = 0; |
|
create_order_spec(ARG3(arg),&ord); |
|
#endif |
|
field = 0; |
|
for ( n = BDY(f); n; n = NEXT(n) ) { |
|
t = get_field_type(BDY(n)); |
|
if ( !t ) |
|
continue; |
|
if ( t < 0 ) |
|
error("dp_gr_f_main : incosistent coefficients"); |
|
if ( !field ) |
|
field = t; |
|
else if ( t != field ) |
|
error("dp_gr_f_main : incosistent coefficients"); |
|
} |
|
dp_gr_main(f,v,homo,m?1:0,field,&ord,rp); |
|
} |
|
|
void Pdp_f4_main(arg,rp) |
void Pdp_f4_main(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
|
|
LIST f,v; |
LIST f,v; |
struct order_spec ord; |
struct order_spec ord; |
|
|
|
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_f4_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_f4_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
create_order_spec(ARG2(arg),&ord); |
create_order_spec(ARG2(arg),&ord); |
dp_f4_main(f,v,&ord,rp); |
dp_f4_main(f,v,&ord,rp); |
} |
} |
|
|
|
/* dp_gr_checklist(list of dp) */ |
|
|
|
void Pdp_gr_checklist(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
VECT g; |
|
LIST dp; |
|
NODE r; |
|
int n; |
|
|
|
do_weyl = 0; |
|
asir_assert(ARG0(arg),O_LIST,"dp_gr_checklist"); |
|
asir_assert(ARG1(arg),O_N,"dp_gr_checklist"); |
|
n = QTOS((Q)ARG1(arg)); |
|
gbcheck_list(BDY((LIST)ARG0(arg)),n,&g,&dp); |
|
r = mknode(2,g,dp); |
|
MKLIST(*rp,r); |
|
} |
|
|
void Pdp_f4_mod_main(arg,rp) |
void Pdp_f4_mod_main(arg,rp) |
NODE arg; |
NODE arg; |
LIST *rp; |
LIST *rp; |
|
|
int m; |
int m; |
struct order_spec ord; |
struct order_spec ord; |
|
|
asir_assert(ARG0(arg),O_LIST,"dp_f4_main"); |
do_weyl = 0; |
asir_assert(ARG1(arg),O_LIST,"dp_f4_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_f4_mod_main"); |
asir_assert(ARG2(arg),O_N,"dp_f4_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_f4_mod_main"); |
|
asir_assert(ARG2(arg),O_N,"dp_f4_mod_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
if ( !m ) |
|
error("dp_f4_mod_main : invalid argument"); |
create_order_spec(ARG3(arg),&ord); |
create_order_spec(ARG3(arg),&ord); |
dp_f4_mod_main(f,v,m,&ord,rp); |
dp_f4_mod_main(f,v,m,&ord,rp); |
} |
} |
|
|
int m; |
int m; |
struct order_spec ord; |
struct order_spec ord; |
|
|
|
do_weyl = 0; |
asir_assert(ARG0(arg),O_LIST,"dp_gr_mod_main"); |
asir_assert(ARG0(arg),O_LIST,"dp_gr_mod_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_mod_main"); |
asir_assert(ARG1(arg),O_LIST,"dp_gr_mod_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_mod_main"); |
asir_assert(ARG2(arg),O_N,"dp_gr_mod_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_mod_main"); |
asir_assert(ARG3(arg),O_N,"dp_gr_mod_main"); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); |
homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); |
|
if ( !m ) |
|
error("dp_gr_mod_main : invalid argument"); |
create_order_spec(ARG4(arg),&ord); |
create_order_spec(ARG4(arg),&ord); |
dp_gr_mod_main(f,v,homo,m,&ord,rp); |
dp_gr_mod_main(f,v,homo,m,&ord,rp); |
} |
} |
|
|
|
/* for Weyl algebra */ |
|
|
|
void Pdp_weyl_gr_main(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
Num homo; |
|
Q m; |
|
int modular; |
|
struct order_spec ord; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main"); |
|
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
|
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
|
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
homo = (Num)ARG2(arg); |
|
m = (Q)ARG3(arg); |
|
if ( !m ) |
|
modular = 0; |
|
else if ( PL(NM(m))>1 || (PL(NM(m)) == 1 && BD(NM(m))[0] >= 0x80000000) ) |
|
error("dp_gr_main : too large modulus"); |
|
else |
|
modular = QTOS(m); |
|
create_order_spec(ARG4(arg),&ord); |
|
do_weyl = 1; |
|
dp_gr_main(f,v,homo,modular,0,&ord,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
void Pdp_weyl_gr_f_main(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
Num homo; |
|
struct order_spec ord; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_main"); |
|
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_main"); |
|
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_main"); |
|
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_main"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
homo = (Num)ARG2(arg); |
|
create_order_spec(ARG3(arg),&ord); |
|
do_weyl = 1; |
|
dp_gr_main(f,v,homo,0,1,&ord,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
void Pdp_weyl_f4_main(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
struct order_spec ord; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main"); |
|
asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
create_order_spec(ARG2(arg),&ord); |
|
do_weyl = 1; |
|
dp_f4_main(f,v,&ord,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
void Pdp_weyl_f4_mod_main(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
int m; |
|
struct order_spec ord; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_f4_main"); |
|
asir_assert(ARG1(arg),O_LIST,"dp_weyl_f4_main"); |
|
asir_assert(ARG2(arg),O_N,"dp_f4_main"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); m = QTOS((Q)ARG2(arg)); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
if ( !m ) |
|
error("dp_weyl_f4_mod_main : invalid argument"); |
|
create_order_spec(ARG3(arg),&ord); |
|
do_weyl = 1; |
|
dp_f4_mod_main(f,v,m,&ord,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
void Pdp_weyl_gr_mod_main(arg,rp) |
|
NODE arg; |
|
LIST *rp; |
|
{ |
|
LIST f,v; |
|
Num homo; |
|
int m; |
|
struct order_spec ord; |
|
|
|
asir_assert(ARG0(arg),O_LIST,"dp_weyl_gr_mod_main"); |
|
asir_assert(ARG1(arg),O_LIST,"dp_weyl_gr_mod_main"); |
|
asir_assert(ARG2(arg),O_N,"dp_weyl_gr_mod_main"); |
|
asir_assert(ARG3(arg),O_N,"dp_weyl_gr_mod_main"); |
|
f = (LIST)ARG0(arg); v = (LIST)ARG1(arg); |
|
f = remove_zero_from_list(f); |
|
if ( !BDY(f) ) { |
|
*rp = f; return; |
|
} |
|
homo = (Num)ARG2(arg); m = QTOS((Q)ARG3(arg)); |
|
if ( !m ) |
|
error("dp_weyl_gr_mod_main : invalid argument"); |
|
create_order_spec(ARG4(arg),&ord); |
|
do_weyl = 1; |
|
dp_gr_mod_main(f,v,homo,m,&ord,rp); |
|
do_weyl = 0; |
|
} |
|
|
|
static VECT current_dl_weight_vector_obj; |
|
int *current_dl_weight_vector; |
|
|
|
void Pdp_set_weight(arg,rp) |
|
NODE arg; |
|
VECT *rp; |
|
{ |
|
VECT v; |
|
int i,n; |
|
|
|
if ( !arg ) |
|
*rp = current_dl_weight_vector_obj; |
|
else if ( !ARG0(arg) ) { |
|
current_dl_weight_vector_obj = 0; |
|
current_dl_weight_vector = 0; |
|
*rp = 0; |
|
} else { |
|
asir_assert(ARG0(arg),O_VECT,"dp_set_weight"); |
|
v = (VECT)ARG0(arg); |
|
current_dl_weight_vector_obj = v; |
|
n = v->len; |
|
current_dl_weight_vector = (int *)CALLOC(n,sizeof(int)); |
|
for ( i = 0; i < n; i++ ) |
|
current_dl_weight_vector[i] = QTOS((Q)v->body[i]); |
|
*rp = v; |
|
} |
|
} |
|
|
|
static VECT current_weyl_weight_vector_obj; |
|
int *current_weyl_weight_vector; |
|
|
|
void Pdp_weyl_set_weight(arg,rp) |
|
NODE arg; |
|
VECT *rp; |
|
{ |
|
VECT v; |
|
int i,n; |
|
|
|
if ( !arg ) |
|
*rp = current_weyl_weight_vector_obj; |
|
else { |
|
asir_assert(ARG0(arg),O_VECT,"dp_weyl_set_weight"); |
|
v = (VECT)ARG0(arg); |
|
current_weyl_weight_vector_obj = v; |
|
n = v->len; |
|
current_weyl_weight_vector = (int *)CALLOC(n,sizeof(int)); |
|
for ( i = 0; i < n; i++ ) |
|
current_weyl_weight_vector[i] = QTOS((Q)v->body[i]); |
|
*rp = v; |
|
} |
|
} |
|
|
|
LIST remove_zero_from_list(LIST l) |
|
{ |
|
NODE n,r0,r; |
|
LIST rl; |
|
|
|
asir_assert(l,O_LIST,"remove_zero_from_list"); |
|
n = BDY(l); |
|
for ( r0 = 0; n; n = NEXT(n) ) |
|
if ( BDY(n) ) { |
|
NEXTNODE(r0,r); |
|
BDY(r) = BDY(n); |
|
} |
|
if ( r0 ) |
|
NEXT(r) = 0; |
|
MKLIST(rl,r0); |
|
return rl; |
|
} |
|
|
|
int get_field_type(P p) |
|
{ |
|
int type,t; |
|
DCP dc; |
|
|
|
if ( !p ) |
|
return 0; |
|
else if ( NUM(p) ) |
|
return NID((Num)p); |
|
else { |
|
type = 0; |
|
for ( dc = DC(p); dc; dc = NEXT(dc) ) { |
|
t = get_field_type(COEF(dc)); |
|
if ( !t ) |
|
continue; |
|
if ( t < 0 ) |
|
return t; |
|
if ( !type ) |
|
type = t; |
|
else if ( t != type ) |
|
return -1; |
|
} |
|
return type; |
|
} |
|
} |