# Difference between revisions of "ApCoCoA-1:NCo.MRReducedGB"

m (replaced <quotes> tag by real quotes) |
|||

(3 intermediate revisions by the same user not shown) | |||

Line 1: | Line 1: | ||

+ | {{Version|1}} | ||

<command> | <command> | ||

<title>NCo.MRReducedGB</title> | <title>NCo.MRReducedGB</title> | ||

Line 8: | Line 9: | ||

</syntax> | </syntax> | ||

<description> | <description> | ||

− | Note that, given a word ordering <tt>Ordering</tt>, a set <tt>G</tt> of non-zero polynomials is called a <em>Groebner basis</em> with respect to <tt>Ordering</tt> if, for every non-zero polynomial <tt>f</tt> in the ideal <tt><G></tt>, there exists a polynomial <tt>g</tt> in <tt>G</tt> such that <tt>MRLW(f)</tt> is a multiple of <tt>MRLW(g)</tt>. Note that a two-sided ideal can not have finite Groebner bases. A Groebner basis <tt>G</tt> is called a <em>reduced Groebner basis</em> if <tt>G</tt> is interreduced (see <ref>NCo.MRInterreduction</ref>) and all polynomials in <tt>G</tt> are monic. Note that each ideal has a unique reduced Groebner basis. However, it is not necessarily finite. | + | Note that, given a word ordering <tt>Ordering</tt>, a set <tt>G</tt> of non-zero polynomials is called a <em>Groebner basis</em> with respect to <tt>Ordering</tt> if, for every non-zero polynomial <tt>f</tt> in the ideal <tt><G></tt>, there exists a polynomial <tt>g</tt> in <tt>G</tt> such that <tt>MRLW(f)</tt> is a multiple of <tt>MRLW(g)</tt>. Note that a two-sided ideal can not have finite Groebner bases. A Groebner basis <tt>G</tt> is called a <em>reduced Groebner basis</em> if <tt>G</tt> is interreduced (see <ref>ApCoCoA-1:NCo.MRInterreduction|NCo.MRInterreduction</ref>) and all polynomials in <tt>G</tt> are monic. Note that each ideal has a unique reduced Groebner basis. However, it is not necessarily finite. |

<par/> | <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/> | ||

− | Please set coefficient field via the function <ref>NCo.SetFp</ref> (or <ref>NCo.UnsetFp</ref>) 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. | + | Please set coefficient field via the function <ref>ApCoCoA-1:NCo.SetFp|NCo.SetFp</ref> (or <ref>ApCoCoA-1:NCo.UnsetFp|NCo.UnsetFp</ref>) 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. |

<itemize> | <itemize> | ||

<item>@param <em>X:</em> 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.</item> | <item>@param <em>X:</em> 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.</item> | ||

− | <item>@param <em>Ordering:</em> 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 | + | <item>@param <em>Ordering:</em> 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 <ref>ApCoCoA-1:NCo.SetOrdering|NCo.SetOrdering</ref> for more details.</item> |

− | <item>@param <em>Relations:</em> 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 <tt><X></tt>. Each word is represented as a STRING. For example, the word <tt>xy^2x</tt> is represented as | + | <item>@param <em>Relations:</em> 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 <tt><X></tt>. Each word is represented as a STRING. For example, the word <tt>xy^2x</tt> is represented as "xyyx", and the identity is represented as the empty string "". Thus, the relation <tt>(yx, xy)</tt> is represented as ["yx", "xy"], and the set of relations <tt>{(yx, xy),(zx,xz),(zy,yz)}</tt> is represented as [["yx", "xy"],["zx", "xz"],["zy", "yz"]].</item> |

− | <item>@param <em>G:</em> a LIST of non-zero polynomials generating a two-sided ideal. Each polynomial is represented as a LIST of monomials, which are pairs of the form [C, W] where W is a word in <tt><X></tt> and C is the coefficient of W. For example, the polynomial <tt>f=xy-y+1</tt> is represented as F:=[[1, | + | <item>@param <em>G:</em> a LIST of non-zero polynomials generating a two-sided ideal. Each polynomial is represented as a LIST of monomials, which are pairs of the form [C, W] where W is a word in <tt><X></tt> and C is the coefficient of W. For example, the polynomial <tt>f=xy-y+1</tt> is represented as F:=[[1,"xy"], [-1, "y"], [1,""]].</item> |

<item>@return: a LIST of polynomials, which is a reduced Groebner basis with respect to the word ordering Ordering if there exists a finite Groebner basis and the enumerating procedure doesn't terminate due to reaching the degree bound DB or the loop bound LB, and is a reduced partial Groebner basis otherwise.</item> | <item>@return: a LIST of polynomials, which is a reduced Groebner basis with respect to the word ordering Ordering if there exists a finite Groebner basis and the enumerating procedure doesn't terminate due to reaching the degree bound DB or the loop bound LB, and is a reduced partial Groebner basis otherwise.</item> | ||

Line 33: | Line 34: | ||

</itemize> | </itemize> | ||

<example> | <example> | ||

− | X := | + | X := "xyzt"; |

− | Ordering := | + | Ordering := "LLEX"; |

Relations:=[]; | Relations:=[]; | ||

− | F1 := [[1, | + | F1 := [[1,"xx"], [-1,"yx"]]; |

− | F2 := [[1, | + | F2 := [[1,"xy"], [-1,"ty"]]; |

− | F3 := [[1, | + | F3 := [[1,"xt"], [-1, "tx"]]; |

− | F4 := [[1, | + | F4 := [[1,"yt"], [-1, "ty"]]; |

G := [F1, F2,F3,F4]; | G := [F1, F2,F3,F4]; | ||

NCo.MRReducedGB(X, Ordering, Relations, G); | NCo.MRReducedGB(X, Ordering, Relations, G); | ||

− | [[[1, | + | [[[1, "yt"], [-1, "ty"]], [[1, "xt"], [-1, "tx"]], [[1, "xy"], [-1, "ty"]], [[1, "xx"], [-1, "yx"]], |

− | [[1, | + | [[1, "tyy"], [-1, "tty"]], [[1, "yyx"], [-1, "tyx"]]] |

------------------------------- | ------------------------------- | ||

− | X := | + | X := "abc"; |

− | Ordering := | + | Ordering := "LLEX"; |

− | Relations := [[ | + | Relations := [["aa",""], ["bb",""], ["ab","c"], ["ac", "b"], ["cb", "a"]]; |

− | F1 := [[1, | + | F1 := [[1,"a"], [1,"b"], [1,"c"]]; |

− | F2 := [[1, | + | F2 := [[1,"b"]]; |

G := [F1, F2]; | G := [F1, F2]; | ||

NCo.MRReducedGB(X, Ordering, Relations, G); | NCo.MRReducedGB(X, Ordering, Relations, G); | ||

− | [[[1, | + | [[[1, "b"]], [[1, "a"], [1, "c"]]] |

------------------------------- | ------------------------------- | ||

</example> | </example> | ||

</description> | </description> | ||

<seealso> | <seealso> | ||

− | <see>NCo.MRGB</see> | + | <see>ApCoCoA-1:NCo.MRGB|NCo.MRGB</see> |

− | <see>NCo.MRInterreduction</see> | + | <see>ApCoCoA-1:NCo.MRInterreduction|NCo.MRInterreduction</see> |

− | <see>NCo.MRIsGB</see> | + | <see>ApCoCoA-1:NCo.MRIsGB|NCo.MRIsGB</see> |

− | <see>NCo.MRLW</see> | + | <see>ApCoCoA-1:NCo.MRLW|NCo.MRLW</see> |

− | <see>NCo.SetFp</see> | + | <see>ApCoCoA-1:NCo.SetFp|NCo.SetFp</see> |

− | <see>NCo.SetOrdering</see> | + | <see>ApCoCoA-1:NCo.SetOrdering|NCo.SetOrdering</see> |

− | <see>NCo.UnsetFp</see> | + | <see>ApCoCoA-1:NCo.UnsetFp|NCo.UnsetFp</see> |

− | <see>Introduction to CoCoAServer</see> | + | <see>ApCoCoA-1:Introduction to CoCoAServer|Introduction to CoCoAServer</see> |

</seealso> | </seealso> | ||

<types> | <types> | ||

Line 77: | Line 78: | ||

<key>NCo.MRReducedGB</key> | <key>NCo.MRReducedGB</key> | ||

<key>MRReducedGB</key> | <key>MRReducedGB</key> | ||

− | <wiki-category>Package_gbmr</wiki-category> | + | <wiki-category>ApCoCoA-1:Package_gbmr</wiki-category> |

</command> | </command> |

## Latest revision as of 13:43, 29 October 2020

This article is about a function from ApCoCoA-1. |

## NCo.MRReducedGB

Enumerate a reduced (partial) Groebner basis of a finitely generated two-sided ideal in a finitely presented monoid ring via the Buchberger procedure.

### Syntax

NCo.MRReducedGB(X:STRING, Ordering:STRING, Relations:LIST, G:LIST[, DB:INT, LB:INT, OFlag:INT]):LIST

### Description

Note that, given a word ordering `Ordering`, a set `G` of non-zero polynomials is called a *Groebner basis* with respect to `Ordering` if, for every non-zero polynomial `f` in the ideal `<G>`, there exists a polynomial `g` in `G` such that `MRLW(f)` is a multiple of `MRLW(g)`. Note that a two-sided ideal can not have finite Groebner bases. A Groebner basis `G` is called a *reduced Groebner basis* if `G` is interreduced (see NCo.MRInterreduction) and all polynomials in `G` are monic. Note that each ideal has a unique reduced Groebner basis. However, it is not necessarily finite.

*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 non-zero polynomials generating a two-sided ideal. 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,""]].@return: a LIST of polynomials, which is a reduced Groebner basis with respect to the word ordering Ordering if there exists a finite Groebner basis and the enumerating procedure doesn't terminate due to reaching the degree bound DB or the loop bound LB, and is a reduced partial Groebner basis otherwise.

About 3 optional parameters: for most cases we do not know whether or not there exists a finite Groebner basis beforehand. Thus, the function offers 3 optional parameters for the enumerating procedure. Note that at the moment *all* of the following 3 optional parameters must be used at the same time.

@param

*DB:*a positive INT, which gives a degree bound of S-polynomials (or obstructions) during the enumerating procedure. When the degree bound is reached, the procedure will be interrupted and return a partial Groebner basis.@param

*LB:*a positive INT, which gives a loop bound of enumerating steps. When the LB-th enumerating step finishes, the procedure will be interrupted and return a partial Groebner basis.@param

*OFlag:*a non-negative INT, which is a multi-switch for the output of the ApCoCoAServer. If OFlag=0, the server displaces nothing on the screen. If OFlag=1, the server prints basic information on the enumerating procedure, such as the number of enumerating steps has been proceeded, the number of elements in partial Groebner basis, the number of unselected obstructions; the total number of obstructions, the number of selected obstructions, and the number of unnecessary obstructions. If OFlag=2, besides the information as OFlag=1, the server also displays explicitly the elements in partial Groebner basis and the current selected S-polynonial. Note that the initial idea of using OFlag is to trace and debug the enumerating procedure.

#### Example

X := "xyzt"; Ordering := "LLEX"; Relations:=[]; F1 := [[1,"xx"], [-1,"yx"]]; F2 := [[1,"xy"], [-1,"ty"]]; F3 := [[1,"xt"], [-1, "tx"]]; F4 := [[1,"yt"], [-1, "ty"]]; G := [F1, F2,F3,F4]; NCo.MRReducedGB(X, Ordering, Relations, G); [[[1, "yt"], [-1, "ty"]], [[1, "xt"], [-1, "tx"]], [[1, "xy"], [-1, "ty"]], [[1, "xx"], [-1, "yx"]], [[1, "tyy"], [-1, "tty"]], [[1, "yyx"], [-1, "tyx"]]] ------------------------------- 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]; NCo.MRReducedGB(X, Ordering, Relations, G); [[[1, "b"]], [[1, "a"], [1, "c"]]] -------------------------------

### See also