Difference between revisions of "ApCoCoA-1:NCo.MRInterreduction"
| Line 3: | Line 3: | ||
<short_description> | <short_description> | ||
Interreduce a LIST of polynomials in a finitely presented monoid ring. | Interreduce a LIST of polynomials in a finitely presented monoid ring. | ||
| − | |||
| − | |||
</short_description> | </short_description> | ||
<syntax> | <syntax> | ||
| Line 10: | Line 8: | ||
</syntax> | </syntax> | ||
<description> | <description> | ||
| + | Given a word ordering, a set <tt>G</tt> of non-zero polynomials is called <em>interreduced</em> if no element of <tt>Supp(g)</tt> is a multiply of any element in the leading word set <tt>MRLW{G\{g}}</tt> for all <tt>g</tt> in <tt>G</tt>. | ||
| + | <par/> | ||
<em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. | <em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. | ||
<par/> | <par/> | ||
Revision as of 20:01, 14 May 2013
NCo.MRInterreduction
Interreduce a LIST of polynomials in a finitely presented monoid ring.
Syntax
NCo.MRInterreduction(X:STRING, Ordering:STRING, Relations:LIST, G:LIST):LIST
Description
Given a word ordering, a set G of non-zero polynomials is called interreduced if no element of Supp(g) is a multiply of any element in the leading word set MRLW{G\{g}} for all g in 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 coefficient field via the function NCo.SetFp (or NCo.UnsetFp) before calling this function. The default coefficient field is the field of rational numbers, i.e. RAT in CoCoAL. For more information, please check the relevant functions.
@param X: a finite alphabet (or set of indeterminates). It is of STRING type. Note that every letter in X MUST appear only once.The order of letters in X induces word orderings.
@param Ordering: a word ordering induced by the order of letters in X. It is a STRING, which is a shortened-form of the name of corresponding word ordering. Note that "LLEX" (the length-lexicographic ordering), "ELIM" (an elimination ordering) and "LRLEX" (the length-reverse-lexicographic ordering) are supported currently. See NCo.SetOrdering for more details.
@param Relations: a finite set of relations. It is of LIST type. Each element in Relations is of the form [W1, W2], where W1 and W2 are words in <X>. Each word is represented as a STRING. For example, the word xy^2x is represented as "xyyx", and the identity is represented as the empty string "". Thus, the relation (yx, xy) is represented as ["yx", "xy"], and the set of relations {(yx, xy),(zx,xz),(zy,yz)} is represented as [["yx", "xy"],["zx", "xz"],["zy", "yz"]].
@param G: a LIST of polynomials in the finitely generated monoid ring. Each polynomial is represented as a LIST of monomials, which are pairs of the form [C, W] where W is a word in <X> and C is the coefficient of W. For example, the polynomial f=xy-y+1 is represented as F:=[[1,"xy"], [-1, "y"], [1,""]]. The zero polynomial 0 is represented as the empty LIST [].
@return: a LIST of interreduced polynomials.
Example
X := <quotes>abc</quotes>; Ordering := <quotes>LLEX</quotes>; Relations := [[<quotes>aa</quotes>,<quotes></quotes>], [<quotes>bb</quotes>,<quotes></quotes>], [<quotes>ab</quotes>,<quotes>c</quotes>], [<quotes>ac</quotes>, <quotes>b</quotes>], [<quotes>cb</quotes>, <quotes>a</quotes>]]; G:=[[[1,<quotes>ba</quotes>]], [[1,<quotes>b</quotes>],[1,<quotes></quotes>]], [[1,<quotes>c</quotes>]]]; NCo.MRInterreduction(X, Ordering, Relations, G); [[[1, <quotes>a</quotes>]], [[1, <quotes>b</quotes>], [1, <quotes></quotes>]], [[1, <quotes>c</quotes>]]] -------------------------------
See also
