up previous next
NC.MRLTIdeal

(Partial) (two-sided) leading-term ideal of a finitely generated ideal over a finitely presented monoid ring.
Syntax
          
NC.MRLTIdeal(X:STRING, Ordering:STRING, Relations:LIST, G:LIST):LIST
NC.MRLTIdeal(X:STRING, Ordering:STRING, Relations:LIST, G:LIST, DegreeBound:INT, LoopBound:INT, Flag:INT):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. Since the algorithm used in this function is based on Groebner basis computation, we refer users to NC.GB or NC.ReducedGB for information about the following optional parameters:

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


See Also