up previous next
NC.GInterreduction

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.
Syntax
          
NC.GInterreduction(G:LIST):LIST

          

Description
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.

Example
NC.SetX("abc");
NC.SetOrdering("ELIM");
Polynomials:=[["ba","c"],["b",""], ["c"]];
NC.GInterreduction(Polynomials);

[["a"], ["b", ""], ["c"]]
-------------------------------


See Also