GROEBNERT _ _ _ _ _ _ _ _ _ _ _ _ operator
groebnert({<v>=<exp>,...})
where <v> are kernels (simple or indexed variables), <exp> are polynomials.
groebnertis functionally equivalent to a groebner call for {<exp>,...}, but the result is a set of equations where the left-hand sides are the basis elements while the right-hand sides are the same values expressed as combinations of the input formulas, expressed in terms of the names <v>
groebnert({p1=2*x**2+4*y**2-100,p2=2*x-y+1}); GB1 := {2*X - Y + 1=P2, 2 9*Y - 2*Y - 199= - 2*X*P2 - Y*P2 + 2*P1 + P2}