GROEBNER\_WALK _ _ _ _ _ _ _ _ _ _ _ _ operator
The operator groebner_walk computes a lex basis from a given graded (or weighted) one.
groebner_walk(<g>)
where <g> is a graded basis (or weighted basis with a weight vector with one repeated element) of the polynomial ideal. Groebner_walk computes a sequence of monomial bases, each time lifting the full system to a complete basis. Groebner_walk should be called only in cases, where a normal kex computation would take too much computer time.
The operator torder has to be called before in order to define the variable sequence and the term order mode of <g>.
The variable gvarslast is not set.
Do not call groebner_walk with on groebopt.
Groebner_walkincludes some overhead (such as e. g. computation with division). On the other hand, sometimes groebner_walk is faster than a direct lex computation.