packages/invbase/invbcomp.red

62 if ordering = 'lex then sub01(v,varlist!*) else (1 . sub01(v,varlist!*) );
155    if not nc!* and not(lz #< length varlist!* #- class d1)
157    else if nc!* and not(lz #< length varlist!* #- nc!*)
234 symbolic procedure !*f2di(f,varlist!*);
235 %%% f: st.f., varlist!*: kernel list --> f in distributive form
238 ((addgt for each v in varlist!* collect 0).(f)).nil else
239 psum(if member(mvar f,varlist!*) then
240      pdmult(!*f2di(lc f,varlist!*),
241             addgt for each v in varlist!* collect
244      else  pcmult(!*f2di(lc f,varlist!*),((lpow f.1).nil)),
245      !*f2di(red f,varlist!*)  );
247 symbolic procedure !*di2q0(p,varlist!*);
253        ) (cdar p, pair(varlist!*,
255        !*di2q0(cdr p,varlist!*) );
257 symbolic procedure !*di2q(p,varlist!*);
258 !*di2q0(for each x in p collect car x . (cdr x . 1), varlist!*);
263 lisp prepsq !*di2q(list car p, varlist!*)," + ",
264 lisp prepsq !*di2q(cdr p, varlist!*);
274       lisp prepsq !*di2q(list car getv(gv!*,car x), varlist!*)," + ",
275       lisp prepsq !*di2q(cdr getv(gv!*,car x), varlist!*);
281    trass("% ordering",varlist!*); printsys("G",reverse gg!*);
358    lb:=lb + length varlist!* - 1;
376                       collect prepsq !*di2q(list m,varlist!*);
412    q:=cadar gg!*; n:=length varlist!*; dim:=0;
474    n:=length varlist!*;
476    return u = for each v in cdr varlist!* collect 0$
490    n:=length varlist!*;
497    n:=length varlist!*; gginv:=mkvect n;
514    varlist!*:=cdr vlist;
516    alfa!*:=mkvect length varlist!*;
517    beta!*:=mkvect length varlist!*;
520    gg!*:=addnew(gcdout !*f2di(numr simp x, varlist!*), ng!*:=ng!*+1, gg!*);
521    vjets!*:=for each v in varlist!* collect !*v2j(v);