tolexm, minipolym

tolexm(plist,vlist1,order,vlist2,mod)

:: Groebner basis computation modulo mod by change of ordering.

minipolym(plist,vlist1,order,poly,v,mod)

:: Minimal polynomial computation modulo mod the same method as

return

tolexm() : list, minipolym() : polynomial

plist vlist1 vlist2

list

order

number, list or matrix

mod

prime

• An input plist must be a Groebner basis modulo mod with respect to the variable order vlist1 and the order type order.
• minipolym() executes the same computation as in minipoly.
• tolexm() computes a lex order Groebner basis modulo mod with respect to the variable order vlist2, by using FGLM algorithm.

[197] tolexm(G0,V,0,V,31991);
[8271*u0^31+10435*u0^30+816*u0^29+26809*u0^28+...,...]
[198] minipolym(G0,V,0,u0,z,31991);
z^32+11405*z^31+20868*z^30+21602*z^29+...

References

section lex_hensel, lex_tl, tolex, tolex_d, tolex_tl, section gr_minipoly, minipoly.

Go to the first, previous, next, last section, table of contents.