version 1.47, 2021/02/01 08:06:33 |
version 1.49, 2021/02/28 02:33:16 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2018/engine/nd.c,v 1.46 2021/01/25 00:39:52 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2018/engine/nd.c,v 1.48 2021/02/18 05:35:01 noro Exp $ */ |
|
|
#include "nd.h" |
#include "nd.h" |
|
|
void print_siglist(NODE l); |
void print_siglist(NODE l); |
|
|
|
NODE nd_hpdata; |
int Nnd_add,Nf4_red,NcriB,NcriMF,Ncri2,Npairs,Nnewpair; |
int Nnd_add,Nf4_red,NcriB,NcriMF,Ncri2,Npairs,Nnewpair; |
struct oEGT eg_search,f4_symb,f4_conv,f4_elim1,f4_elim2; |
struct oEGT eg_search,f4_symb,f4_conv,f4_elim1,f4_elim2; |
|
|
Line 92 struct comp_sig_spec { |
|
Line 93 struct comp_sig_spec { |
|
|
|
struct comp_sig_spec *nd_sba_modord; |
struct comp_sig_spec *nd_sba_modord; |
|
|
|
DL ndltodl(int n,UINT *ndl); |
NumberField get_numberfield(); |
NumberField get_numberfield(); |
UINT *nd_det_compute_bound(NDV **dm,int n,int j); |
UINT *nd_det_compute_bound(NDV **dm,int n,int j); |
void nd_det_reconstruct(NDV **dm,int n,int j,NDV d); |
void nd_det_reconstruct(NDV **dm,int n,int j,NDV d); |
Line 2467 LIST compute_splist() |
|
Line 2469 LIST compute_splist() |
|
return l0; |
return l0; |
} |
} |
|
|
|
typedef struct oHPDATA { |
|
P hn; // HP(t)=hn(t)/(1-t)^n |
|
int len; |
|
P *head; // hp(i)=head[i] (i=0,...,len-1) |
|
P hp; // dim Hm(i)=hp(i) (i >= len) |
|
VECT x; // BDY(x)[i] = <<0,...,1,...,0>> |
|
P *plist; // plist[i]=(1-t)^i |
|
} *HPDATA; |
|
|
|
void make_reduced(VECT b,int nv); |
|
void mhp_rec(VECT b,VECT x,P t,P *r); |
|
P mhp_ctop(P *r,P *plist,int n); |
|
void mhp_to_hf(VL vl,P hp,int n,P *plist,VECT *head,P *hf); |
|
DL monomial_colon(DL a,DL b,int n); |
|
LIST dp_monomial_hilbert_poincare(VECT b,VECT x,P *plist); |
|
|
|
int hpvalue(HPDATA data,int d) |
|
{ |
|
P *head; |
|
int len; |
|
P hp,val; |
|
Z dz; |
|
|
|
head = data->head; |
|
len = data->len; |
|
hp = data->hp; |
|
if ( d < len ) |
|
return ZTOS((Z)head[d]); |
|
else { |
|
STOZ(d,dz); |
|
substp(CO,hp,hp->v,(P)dz,&val); |
|
return ZTOS((Z)val); |
|
} |
|
} |
|
|
|
void setup_hpdata(HPDATA final,HPDATA current) |
|
{ |
|
int n,i; |
|
P *r; |
|
DL *p; |
|
P tv; |
|
VECT b,x,head; |
|
DL dl; |
|
|
|
n = nd_nvar; |
|
final->hn = (P)ARG0(nd_hpdata); |
|
head = (VECT)ARG2(nd_hpdata); |
|
final->len = head->len; |
|
final->head = (P *)BDY(head); |
|
final->hp = (P)ARG3(nd_hpdata); |
|
final->plist = (P *)BDY((VECT)ARG4(nd_hpdata)); |
|
MKVECT(x,n); |
|
for ( i = 0; i < n; i++ ) { |
|
NEWDL(dl,n); dl->d[i] = 1; dl->td = 1; BDY(x)[i] = dl; |
|
} |
|
final->x = x; |
|
|
|
r = (P *)CALLOC(n+1,sizeof(P)); |
|
MKVECT(b,nd_psn); p = (DL *)BDY(b); |
|
for ( i = 0; i < nd_psn; i++ ) { |
|
p[i] = ndltodl(n,nd_psh[i]->dl); |
|
} |
|
make_reduced(b,n); |
|
makevar("t",&tv); |
|
mhp_rec(b,x,tv,r); |
|
current->hn = mhp_ctop(r,final->plist,n); |
|
mhp_to_hf(CO,current->hn,n,final->plist,&head,¤t->hp); |
|
current->head = (P *)BDY(head); |
|
current->len = head->len; |
|
current->x = x; |
|
current->plist = final->plist; |
|
} |
|
|
|
void update_hpdata(HPDATA current,int nh,int do_hf) |
|
{ |
|
NODE data1,nd,t; |
|
DL new,dl; |
|
int len,i,n; |
|
Z dz; |
|
DL *p; |
|
VECT b,head; |
|
P tv,td,s,hn,hpoly; |
|
LIST list1; |
|
|
|
n = nd_nvar; |
|
new = ndltodl(n,nd_psh[nh]->dl); |
|
MKVECT(b,nh); p = (DL *)BDY(b); |
|
for ( i = 0; i < nh; i++ ) { |
|
p[i] = monomial_colon(ndltodl(n,nd_psh[i]->dl),new,n); |
|
} |
|
// compute HP(I:new) |
|
list1 = dp_monomial_hilbert_poincare(b,current->x,current->plist); |
|
data1 = BDY((LIST)list1); |
|
// HP(I+<new>) = H(I)-t^d*H(I:new), d=tdeg(new) |
|
makevar("t",&tv); UTOZ(new->td,dz); |
|
pwrp(CO,tv,dz,&td); |
|
mulp(CO,(P)ARG0(data1),td,&s); |
|
subp(CO,current->hn,s,&hn); |
|
current->hn = hn; |
|
if ( do_hf ) { |
|
mhp_to_hf(CO,hn,n,current->plist,&head,&hpoly); |
|
current->head = (P *)BDY(head); |
|
current->len = head->len; |
|
current->hp = hpoly; |
|
} |
|
} |
|
|
|
ND_pairs nd_remove_same_sugar( ND_pairs d, int sugar) |
|
{ |
|
struct oND_pairs root; |
|
ND_pairs prev,cur; |
|
|
|
root.next = d; |
|
prev = &root; cur = d; |
|
while ( cur ) { |
|
if ( SG(cur) == sugar ) |
|
prev->next = cur->next; |
|
else |
|
prev = cur; |
|
cur = cur->next; |
|
} |
|
return root.next; |
|
} |
|
|
/* return value = 0 => input is not a GB */ |
/* return value = 0 => input is not a GB */ |
|
|
NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,int **indp) |
NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,int **indp) |
Line 2483 NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,i |
|
Line 2609 NODE nd_gb(int m,int ishomo,int checkonly,int gensyz,i |
|
int Nnfnz = 0,Nnfz = 0; |
int Nnfnz = 0,Nnfz = 0; |
P cont; |
P cont; |
LIST list; |
LIST list; |
|
struct oHPDATA current_hpdata,final_hpdata; |
|
int final_hpvalue; |
|
|
struct oEGT eg1,eg2,eg_update; |
struct oEGT eg1,eg2,eg_update; |
|
|
init_eg(&eg_update); |
init_eg(&eg_update); |
Line 2493 init_eg(&eg_update); |
|
Line 2622 init_eg(&eg_update); |
|
g = update_base(g,i); |
g = update_base(g,i); |
} |
} |
sugar = 0; |
sugar = 0; |
|
if ( nd_hpdata ) { |
|
setup_hpdata(&final_hpdata,¤t_hpdata); |
|
} |
while ( d ) { |
while ( d ) { |
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
|
|
} |
} |
sugar = SG(l); |
sugar = SG(l); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
|
if ( nd_hpdata ) { |
|
if ( !compp(CO,final_hpdata.hn,current_hpdata.hn) ) |
|
break; |
|
else { |
|
final_hpvalue = hpvalue(&final_hpdata,sugar); |
|
if ( final_hpvalue == hpvalue(¤t_hpdata,sugar) ) { |
|
if ( DP_Print ) fprintf(asir_out,"sugar=%d done.\n",sugar); |
|
d = nd_remove_same_sugar(d,sugar); |
|
continue; |
|
} |
|
} |
|
} |
} |
} |
stat = nd_sp(m,0,l,&h); |
stat = nd_sp(m,0,l,&h); |
if ( !stat ) { |
if ( !stat ) { |
|
|
get_eg(&eg2); add_eg(&eg_update,&eg1,&eg2); |
get_eg(&eg2); add_eg(&eg_update,&eg1,&eg2); |
g = update_base(g,nh); |
g = update_base(g,nh); |
FREENDP(l); |
FREENDP(l); |
|
if ( nd_hpdata ) { |
|
update_hpdata(¤t_hpdata,nh,1); |
|
if ( final_hpvalue == hpvalue(¤t_hpdata,sugar) ) { |
|
if ( DP_Print ) fprintf(asir_out,"sugar=%d done.\n",sugar); |
|
d = nd_remove_same_sugar(d,sugar); |
|
} |
|
} |
} else { |
} else { |
Nnfz++; |
Nnfz++; |
if ( nd_gentrace && gensyz ) { |
if ( nd_gentrace && gensyz ) { |
Line 2853 NODE nd_sba_buch(int m,int ishomo,int **indp,NODE *syz |
|
Line 3004 NODE nd_sba_buch(int m,int ishomo,int **indp,NODE *syz |
|
int ngen,ind; |
int ngen,ind; |
int Nnominimal,Nredundant; |
int Nnominimal,Nredundant; |
DL lcm,quo,mul; |
DL lcm,quo,mul; |
|
struct oHPDATA final_hpdata,current_hpdata; |
struct oEGT eg1,eg2,eg_update,eg_remove,eg_large,eg_nf,eg_nfzero,eg_minsig,eg_smallest; |
struct oEGT eg1,eg2,eg_update,eg_remove,eg_large,eg_nf,eg_nfzero,eg_minsig,eg_smallest; |
int Nnfs=0,Nnfz=0,Nnfnz=0,dlen,nsyz; |
int Nnfs=0,Nnfz=0,Nnfnz=0,dlen,nsyz; |
|
|
Line 2865 init_eg(&eg_remove); |
|
Line 3017 init_eg(&eg_remove); |
|
Nnominimal = 0; |
Nnominimal = 0; |
Nredundant = 0; |
Nredundant = 0; |
ngen = nd_psn; |
ngen = nd_psn; |
for ( i = 0; i < nd_psn; i++ ) |
if ( !do_weyl ) { |
for ( j = i+1; j < nd_psn; j++ ) { |
for ( i = 0; i < nd_psn; i++ ) |
sig = trivial_sig(i,j); |
for ( j = i+1; j < nd_psn; j++ ) { |
syzlist[sig->pos] = insert_sig(syzlist[sig->pos],sig); |
sig = trivial_sig(i,j); |
|
syzlist[sig->pos] = insert_sig(syzlist[sig->pos],sig); |
|
} |
} |
} |
dlen = 0; |
dlen = 0; |
for ( i = 0; i < nd_psn; i++ ) { |
for ( i = 0; i < nd_psn; i++ ) { |
Line 2876 init_eg(&eg_remove); |
|
Line 3030 init_eg(&eg_remove); |
|
} |
} |
sugar = 0; |
sugar = 0; |
pos = 0; |
pos = 0; |
|
if ( nd_hpdata ) { |
|
setup_hpdata(&final_hpdata,¤t_hpdata); |
|
} |
NEWDL(lcm,nd_nvar); NEWDL(quo,nd_nvar); NEWDL(mul,nd_nvar); |
NEWDL(lcm,nd_nvar); NEWDL(quo,nd_nvar); NEWDL(mul,nd_nvar); |
init_eg(&eg_create); |
init_eg(&eg_create); |
init_eg(&eg_merge); |
init_eg(&eg_merge); |
|
|
|
|
dlen += update_pairs_array_s(d,nh,syzlist); |
dlen += update_pairs_array_s(d,nh,syzlist); |
nd_sba_pos[sig->pos] = append_one(nd_sba_pos[sig->pos],nh); |
nd_sba_pos[sig->pos] = append_one(nd_sba_pos[sig->pos],nh); |
|
if ( nd_hpdata ) { |
|
update_hpdata(¤t_hpdata,nh,0); |
|
if ( !compp(CO,final_hpdata.hn,current_hpdata.hn) ) { |
|
if ( DP_Print ) { printf("\nWe found a gb.\n"); } |
|
break; |
|
} |
|
} |
} else { |
} else { |
d[ind] = d[ind]->next; dlen--; |
d[ind] = d[ind]->next; dlen--; |
Nnfz++; |
Nnfz++; |
Line 3172 NODE nd_gb_trace(int m,int ishomo,int **indp) |
|
Line 3336 NODE nd_gb_trace(int m,int ishomo,int **indp) |
|
int diag_count = 0; |
int diag_count = 0; |
P cont; |
P cont; |
LIST list; |
LIST list; |
|
struct oHPDATA current_hpdata,final_hpdata; |
|
int final_hpvalue; |
|
|
init_eg(&eg_monic); |
init_eg(&eg_monic); |
init_eg(&eg_invdalg); |
init_eg(&eg_invdalg); |
Line 3182 NODE nd_gb_trace(int m,int ishomo,int **indp) |
|
Line 3348 NODE nd_gb_trace(int m,int ishomo,int **indp) |
|
g = update_base(g,i); |
g = update_base(g,i); |
} |
} |
sugar = 0; |
sugar = 0; |
|
if ( nd_hpdata ) { |
|
setup_hpdata(&final_hpdata,¤t_hpdata); |
|
} |
|
|
while ( d ) { |
while ( d ) { |
again: |
again: |
l = nd_minp(d,&d); |
l = nd_minp(d,&d); |
|
|
#endif |
#endif |
sugar = SG(l); |
sugar = SG(l); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
if ( DP_Print ) fprintf(asir_out,"%d",sugar); |
|
if ( nd_hpdata ) { |
|
if ( !compp(CO,final_hpdata.hn,current_hpdata.hn) ) |
|
break; |
|
else { |
|
final_hpvalue = hpvalue(&final_hpdata,sugar); |
|
if ( final_hpvalue == hpvalue(¤t_hpdata,sugar) ) { |
|
if ( DP_Print ) fprintf(asir_out,"sugar=%d done.\n",sugar); |
|
d = nd_remove_same_sugar(d,sugar); |
|
continue; |
|
} |
|
} |
|
} |
} |
} |
stat = nd_sp(m,0,l,&h); |
stat = nd_sp(m,0,l,&h); |
if ( !stat ) { |
if ( !stat ) { |
|
|
} |
} |
d = update_pairs(d,g,nh,0); |
d = update_pairs(d,g,nh,0); |
g = update_base(g,nh); |
g = update_base(g,nh); |
|
if ( nd_hpdata ) { |
|
update_hpdata(¤t_hpdata,nh,1); |
|
if ( final_hpvalue == hpvalue(¤t_hpdata,sugar) ) { |
|
if ( DP_Print ) fprintf(asir_out,"sugar=%d done.\n",sugar); |
|
d = nd_remove_same_sugar(d,sugar); |
|
} |
|
} |
} else { |
} else { |
if ( DP_Print ) { printf("*"); fflush(stdout); } |
if ( DP_Print ) { printf("*"); fflush(stdout); } |
} |
} |
Line 3737 int _create_spair_s(int i1,int i2,ND_pairs sp,SIG sig1 |
|
Line 3926 int _create_spair_s(int i1,int i2,ND_pairs sp,SIG sig1 |
|
p1 = nd_psh[i1]; |
p1 = nd_psh[i1]; |
p2 = nd_psh[i2]; |
p2 = nd_psh[i2]; |
ndl_lcm(DL(p1),DL(p2),sp->lcm); |
ndl_lcm(DL(p1),DL(p2),sp->lcm); |
|
#if 0 |
s1 = SG(p1)-TD(DL(p1)); |
s1 = SG(p1)-TD(DL(p1)); |
s2 = SG(p2)-TD(DL(p2)); |
s2 = SG(p2)-TD(DL(p2)); |
SG(sp) = MAX(s1,s2) + TD(sp->lcm); |
SG(sp) = MAX(s1,s2) + TD(sp->lcm); |
|
#endif |
|
|
if ( wpd != nd_wpd ) { |
if ( wpd != nd_wpd ) { |
wpd = nd_wpd; |
wpd = nd_wpd; |
Line 3765 int _create_spair_s(int i1,int i2,ND_pairs sp,SIG sig1 |
|
Line 3956 int _create_spair_s(int i1,int i2,ND_pairs sp,SIG sig1 |
|
if ( ret == 0 ) return 0; |
if ( ret == 0 ) return 0; |
else if ( ret > 0 ) sp->sig = sig1; |
else if ( ret > 0 ) sp->sig = sig1; |
else sp->sig = sig2; |
else sp->sig = sig2; |
|
|
|
s1 = DL(sig1)->td+nd_sba_hm[p1->sig->pos]->td; |
|
s2 = DL(sig2)->td+nd_sba_hm[p2->sig->pos]->td; |
|
SG(sp) = MAX(s1,s2); |
|
|
return 1; |
return 1; |
} |
} |
|
|
Line 6968 ND ptond(VL vl,VL dvl,P p) |
|
Line 7164 ND ptond(VL vl,VL dvl,P p) |
|
else if ( NUM(p) ) { |
else if ( NUM(p) ) { |
NEWNM(m); |
NEWNM(m); |
ndl_zero(DL(m)); |
ndl_zero(DL(m)); |
if ( !INT((Q)p) ) |
if ( RATN(p) && !INT((Q)p) ) |
error("ptond : input must be integer-coefficient"); |
error("ptond : input must be integer-coefficient"); |
CZ(m) = (Z)p; |
CZ(m) = (Z)p; |
NEXT(m) = 0; |
NEXT(m) = 0; |
Line 10386 void parse_nd_option(VL vl,NODE opt) |
|
Line 10582 void parse_nd_option(VL vl,NODE opt) |
|
nd_f4_td = 0; nd_sba_f4step = 2; nd_sba_pot = 0; nd_sba_largelcm = 0; |
nd_f4_td = 0; nd_sba_f4step = 2; nd_sba_pot = 0; nd_sba_largelcm = 0; |
nd_sba_dontsort = 0; nd_top = 0; nd_sba_redundant_check = 0; |
nd_sba_dontsort = 0; nd_top = 0; nd_sba_redundant_check = 0; |
nd_sba_syz = 0; nd_sba_modord = 0; nd_sba_inputisgb = 0; |
nd_sba_syz = 0; nd_sba_modord = 0; nd_sba_inputisgb = 0; |
|
nd_hpdata = 0; |
|
|
for ( t = opt; t; t = NEXT(t) ) { |
for ( t = opt; t; t = NEXT(t) ) { |
p = BDY((LIST)BDY(t)); |
p = BDY((LIST)BDY(t)); |
Line 10433 void parse_nd_option(VL vl,NODE opt) |
|
Line 10630 void parse_nd_option(VL vl,NODE opt) |
|
nd_splist = value?1:0; |
nd_splist = value?1:0; |
} else if ( !strcmp(key,"check_splist") ) { |
} else if ( !strcmp(key,"check_splist") ) { |
nd_check_splist = BDY((LIST)value); |
nd_check_splist = BDY((LIST)value); |
|
} else if ( !strcmp(key,"hpdata") ) { |
|
nd_hpdata = BDY((LIST)value); |
} else if ( !strcmp(key,"sugarweight") ) { |
} else if ( !strcmp(key,"sugarweight") ) { |
u = BDY((LIST)value); |
u = BDY((LIST)value); |
n = length(u); |
n = length(u); |