up previous next
NC.MRInterreduction

Interreduce a list (set) of polynomials in a finitely presented monoid ring.

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.MRInterreduction(X:STRING, Ordering:STRING, Relations:LIST, 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 coefficient field via the function NC.SetFp (or NC.UnsetFp) before calling this function. The default coefficient field is Q. For more information, please check the relevant function.

Example
X := "abc";
Ordering := "LLEX";
Relations := [["aa",""], ["bb",""], ["ab","c"], ["ac", "b"], ["cb", "a"]];
G:=[[[1,"ba"]], [[1,"b"],[1,""]], [[1,"c"]]];
NC.MRInterreduction(X, Ordering, Relations, G);

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


See Also