up previous next
Interreduce a list (set) of polynomials in a free monoid ring over
F2.
Note that, given an admissible ordering
Ordering, a set of non-zero polynomial
G is called
interreduced w.r.t.
Ordering if no element of
Supp(g) is contained in
LT(G\{g}) for all
g in
G.
NC.GInterreduction(G:LIST):LIST
|
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
alphabet (or set of indeterminates)
X and
admissible ordering via the functions
NC.SetX and
NC.SetOrdering, respectively, before calling the function. The default ordering is length-lexicographic ordering ("LLEX"). For more information, please check the relevant functions.
- @param G: a LIST of polynomials in the free monoid ring F2. Each polynomial is represented as a LIST of words (or terms) in . Each word is represented as a STRING. For example, xy^2x is represented as "xyyx", and the identity is represented as the empty string "". Thus, the polynomial F=xy-y+1 in F2 is represented as F:=["xy", "y", ""]. The zero polynomial 0 is represented as the empty LIST [].
- @return: a LIST of interreduced polynomials.
NC.SetX("abc");
NC.SetOrdering("ELIM");
Polynomials:=[["ba","c"],["b",""], ["c"]];
NC.GInterreduction(Polynomials);
[["a"], ["b", ""], ["c"]]
-------------------------------
|