`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
     *Note `lex_hensel lex_tl tolex tolex_d tolex_tl': lex_hensel
     lex_tl tolex tolex_d tolex_tl, *Note `gr_minipoly minipoly':
     gr_minipoly minipoly.

