up previous next
Check whether a finite list (set) of non-zero polynomials in a free monoid ring is a Groebner basis.
Note that, given an ideal
I and an admissible ordering
Ordering, a set of non-zero polynomials
Gb is called a
Groebner basis of
I w.r.t.
Ordering if the leading term set
LT{Gb} (w.r.t.
Ordering) generates the leading term ideal
LT(I) (w.r.t.
Ordering). The function check whether a given finite set of non-zero polynomial
G is a Groebner basis by using the
Buchberger Criterion, i.e.
G is a Groebner basis if all the
S-polynomials of obstructions have the zero normal remainder w.r.t.
G.
Please note: The function(s) explained on this page is/are using the
ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.
Please set ring environment
coefficient fieldK,
alphabet (or set of indeterminates)
X and
ordering via the functions
NC.SetFp,
NC.SetX and
NC.SetOrdering, respectively, before calling the function. The default coefficient field is
Q. The default ordering is length-lexicographic ordering ("LLEX"). For more information, please check the relevant functions.
- @param G: a LIST of non-zero polynomials in K. Each polynomial is represented as a LIST of monomials, which are pairs of the form [C, W] where W is a word in and C is the coefficient of W. For example, the polynomial F=xy-y+1 is represented as F:=[[1,"xy"], [-1, "y"], [1,""]].
- @return: a BOOL value which is True if G is a Groebner basis w.r.t. the current ordering and False otherwise.
NC.SetX("xyt");
F1 := [[1,"xx"], [-1,"yx"]];
F2 := [[1,"xy"], [-1,"ty"]];
F3 := [[1,"xt"], [-1, "tx"]];
F4 := [[1,"yt"], [-1, "ty"]];
G := [F1, F2,F3,F4];
NC.IsGB(G); -- LLEX ordering (default ordering)
False
-------------------------------
NC.SetOrdering("ELIM");
NC.IsGB(G);
False
-------------------------------
|