# Difference between revisions of "ApCoCoA-1:NC.TruncatedGB"

Line 2: | Line 2: | ||

<title>NC.TruncatedGB</title> | <title>NC.TruncatedGB</title> | ||

<short_description> | <short_description> | ||

− | Compute | + | Compute truncated Groebner bases of finitely generated homogeneous two-sided ideals in a non-commutative polynomial ring. |

+ | <par/> | ||

+ | Given a word ordering and a homogeneous two-sided ideal <tt>I</tt>, a set of non-zero polynomials <tt>Gb</tt> is called a <em>Groebner basis</em> of <tt>I</tt> if the leading word set <tt>LT{Gb}</tt> generates the leading word ideal <tt>LT(I)</tt>. Note that it may not exist finite Groebner basis of the ideal <tt>I</tt>. Moreover, let <tt>D</tt> be a positive integer. Then the set <tt>{g in Gb | Deg(g)<=D}</tt> is a Groebner basis of the ideal <tt><f in I | Deg(f)<=D></tt> and is called a <em>D-truncated</em> Groebner basis of <tt>I</tt>. | ||

</short_description> | </short_description> | ||

<syntax> | <syntax> | ||

− | NC.TruncatedGB(G:LIST, | + | NC.TruncatedGB(G:LIST[, Optimize:INT, OFlag:INT, DB:INT]):LIST |

− | |||

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

<description> | <description> | ||

<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 ring | + | Please set non-commutative polynomial ring (via the command <ref>Use</ref>) and word ordering (via the function <ref>NC.SetOrdering</ref>) before calling this function. The default word ordering is the length-lexicographic ordering (<quotes>LLEX</quotes>). For more information, please check the relevant commands and functions. |

<itemize> | <itemize> | ||

− | <item>@param <em>G</em>: a LIST of non-zero homogeneous polynomials | + | <item>@param <em>G</em>: a LIST of non-zero non-commutative homogeneous polynomials that generate a homogeneous two-sided ideal. Each polynomial is represented as a LIST of LISTs, and each element in every inner LIST involves only one indeterminate or none (a constant). For example, the polynomial <tt>f=2x[2]y[1]x[2]^2-9y[2]x[1]^2x[2]^3+5</tt> is represented as F:=[[2x[1],y[1],x[2]^2], [-9y[2],x[1]^2,x[2]^3], [5]]. The zero polynomial <tt>0</tt> is represented as the empty LIST [].</item> |

− | <item>@ | + | |

+ | <item>@return: a LIST of non-zero non-commutative homogeneous polynomials, which form a DB-truncated Groebner basis of the homogeneous two-sided ideal generated by G.</item> | ||

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

− | + | ||

+ | Optional parameters: | ||

<itemize> | <itemize> | ||

− | <item>@param <em> | + | <item>@param <em>Optimize:</em> an INT between 0 and 31. The value of Optimize indicates which criteria are used in the Buchberger procedure. For the time being, the function supports 5 criteria as follows. |

− | <item>@param <em> | + | The multiply criterion: Optimize=1; |

− | <item>@ | + | The leading word criterion: Optimize=2; |

+ | The tail reduction criterion: Optimize=4; | ||

+ | The backward criterion: Optimize=8; | ||

+ | Discarding redundant generators: Optimize=16; | ||

+ | (Reference: M. Kreuzer and X. Xiu, Non-Commutative Gebauer-Moeller Criteria, 2013.) | ||

+ | One can choose none, one, or more than one criterion in the function. For instance, Optimize=0 means no criterion is used, Optimize=1 means applying the multiply criterion, Optimize=3 (1+2) means applying the multiply and the leading word criteria, etc. By default, Optimize=31, i.e. the function applies all criteria.</item> | ||

+ | |||

+ | <item>@param <em>OFlag:</em> an INT that indicates which information will be output by the ApCoCoAServer during the Buchberger enumerating procedure. If OFlag=1, the ApCoCoAServer outputs basic information, such as the number of enumerating steps that has been proceeded, the number of elements in partial Groebner basis, the degree of current selected obstruction, the number of unselected obstructions, the total number of obstructions, the number of selected obstructions, and the number of unnecessary obstructions. If Flag=2, besides the information as FLAG=1, the ApCoCoAServer also displays explicitly the elements in paritial Groebner basis and the current selected S-polynonial. Otherwise, the ApCoCoAServer outputs nothing during the procedure.</item> | ||

+ | |||

+ | <item>@param <em>DB:</em> a positive INT, which gives a degree bound of S-polynomials (or obstructions) during the Buchberger enumerating procedure. The procedure will discard S-polynomials (or obstructions) whose degrees are larger than DB.</item> | ||

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

<example> | <example> | ||

Line 45: | Line 57: | ||

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

<seealso> | <seealso> | ||

+ | <see>Use</see> | ||

<see>NC.GB</see> | <see>NC.GB</see> | ||

<see>NC.IsGB</see> | <see>NC.IsGB</see> | ||

Line 53: | Line 66: | ||

<types> | <types> | ||

<type>apcocoaserver</type> | <type>apcocoaserver</type> | ||

+ | <type>ideal</type> | ||

<type>groebner</type> | <type>groebner</type> | ||

<type>non_commutative</type> | <type>non_commutative</type> | ||

− | |||

</types> | </types> | ||

<key>ncpoly.TruncatedGB</key> | <key>ncpoly.TruncatedGB</key> |

## Revision as of 19:51, 26 April 2013

## NC.TruncatedGB

Compute truncated Groebner bases of finitely generated homogeneous two-sided ideals in a non-commutative polynomial ring.

Given a word ordering and a homogeneous two-sided ideal `I`, a set of non-zero polynomials `Gb` is called a *Groebner basis* of `I` if the leading word set `LT{Gb}` generates the leading word ideal `LT(I)`. Note that it may not exist finite Groebner basis of the ideal `I`. Moreover, let `D` be a positive integer. Then the set `{g in Gb | Deg(g)<=D}` is a Groebner basis of the ideal `<f in I | Deg(f)<=D>` and is called a *D-truncated* Groebner basis of `I`.

### Syntax

NC.TruncatedGB(G:LIST[, Optimize:INT, OFlag:INT, DB: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.

Please set non-commutative polynomial ring (via the command Use) and word ordering (via the function NC.SetOrdering) before calling this function. The default word ordering is the length-lexicographic ordering ("LLEX"). For more information, please check the relevant commands and functions.

@param

*G*: a LIST of non-zero non-commutative homogeneous polynomials that generate a homogeneous two-sided ideal. Each polynomial is represented as a LIST of LISTs, and each element in every inner LIST involves only one indeterminate or none (a constant). For example, the polynomial`f=2x[2]y[1]x[2]^2-9y[2]x[1]^2x[2]^3+5`is represented as F:=[[2x[1],y[1],x[2]^2], [-9y[2],x[1]^2,x[2]^3], [5]]. The zero polynomial`0`is represented as the empty LIST [].@return: a LIST of non-zero non-commutative homogeneous polynomials, which form a DB-truncated Groebner basis of the homogeneous two-sided ideal generated by G.

Optional parameters:

@param

*Optimize:*an INT between 0 and 31. The value of Optimize indicates which criteria are used in the Buchberger procedure. For the time being, the function supports 5 criteria as follows.The multiply criterion: Optimize=1; The leading word criterion: Optimize=2; The tail reduction criterion: Optimize=4; The backward criterion: Optimize=8; Discarding redundant generators: Optimize=16; (Reference: M. Kreuzer and X. Xiu, Non-Commutative Gebauer-Moeller Criteria, 2013.)

One can choose none, one, or more than one criterion in the function. For instance, Optimize=0 means no criterion is used, Optimize=1 means applying the multiply criterion, Optimize=3 (1+2) means applying the multiply and the leading word criteria, etc. By default, Optimize=31, i.e. the function applies all criteria.

@param

*OFlag:*an INT that indicates which information will be output by the ApCoCoAServer during the Buchberger enumerating procedure. If OFlag=1, the ApCoCoAServer outputs basic information, such as the number of enumerating steps that has been proceeded, the number of elements in partial Groebner basis, the degree of current selected obstruction, the number of unselected obstructions, the total number of obstructions, the number of selected obstructions, and the number of unnecessary obstructions. If Flag=2, besides the information as FLAG=1, the ApCoCoAServer also displays explicitly the elements in paritial Groebner basis and the current selected S-polynonial. Otherwise, the ApCoCoAServer outputs nothing during the procedure.@param

*DB:*a positive INT, which gives a degree bound of S-polynomials (or obstructions) during the Buchberger enumerating procedure. The procedure will discard S-polynomials (or obstructions) whose degrees are larger than DB.

#### Example

NC.SetX(<quotes>xyz</quotes>); F1:=[[1,<quotes>yxy</quotes>],[-1,<quotes>zyz</quotes>]]; F2:=[[1,<quotes>xyx</quotes>],[-1,<quotes>zxy</quotes>]]; F3:=[[1,<quotes>zxz</quotes>],[-1,<quotes>yzx</quotes>]]; F4:=[[1,<quotes>xxx</quotes>],[1,<quotes>yyy</quotes>],[1,<quotes>zzz</quotes>],[1,<quotes>xyz</quotes>]]; G:=[F1,F2,F3,F4]; NC.TruncatedGB(G,6); [[[1, <quotes>yzx</quotes>], [-1, <quotes>zxz</quotes>]], [[1, <quotes>yxy</quotes>], [-1, <quotes>zyz</quotes>]], [[1, <quotes>xyx</quotes>], [-1, <quotes>zxy</quotes>]], [[1, <quotes>xxx</quotes>], [1, <quotes>xyz</quotes>], [1, <quotes>yyy</quotes>], [1, <quotes>zzz</quotes>]], [[1, <quotes>zxzy</quotes>], [-1, <quotes>zzxz</quotes>]], [[1, <quotes>xzyz</quotes>], [-1, <quotes>zxyy</quotes>]], [[1, <quotes>xxyz</quotes>], [1, <quotes>xyyy</quotes>], [-1, <quotes>xzxz</quotes>], [1, <quotes>xzzz</quotes>], [-1, <quotes>yyyx</quotes>], [-1, <quotes>zzzx</quotes>]], [[1, <quotes>zzxyy</quotes>], [-1, <quotes>zzxzz</quotes>]], [[1, <quotes>yzzxz</quotes>], [-1, <quotes>zxzzy</quotes>]], [[1, <quotes>yzzxy</quotes>], [-1, <quotes>zzxzx</quotes>]], [[1, <quotes>yzyyy</quotes>], [1, <quotes>yzzzz</quotes>], [1, <quotes>zxzxx</quotes>], [1, <quotes>zzxzz</quotes>]], [[1, <quotes>yxzxz</quotes>], [-1, <quotes>zyzzx</quotes>]], [[1, <quotes>xzzxz</quotes>], [-1, <quotes>zxyyx</quotes>]], [[1, <quotes>xyyyy</quotes>], [1, <quotes>xyzzz</quotes>], [1, <quotes>zxyyz</quotes>], [1, <quotes>zzzxy</quotes>]], [[1, <quotes>xxzxz</quotes>], [1, <quotes>xyyyx</quotes>], [-1, <quotes>xzxzx</quotes>], [1, <quotes>xzzzx</quotes>], [-1, <quotes>yyyxx</quotes>], [-1, <quotes>zzzxx</quotes>]], [[1, <quotes>xxzxy</quotes>], [1, <quotes>xyzyx</quotes>], [1, <quotes>yyyyx</quotes>], [1, <quotes>zzzyx</quotes>]], [[1, <quotes>xxyyy</quotes>], [1, <quotes>xxzzz</quotes>], [-1, <quotes>xyzyz</quotes>], [-1, <quotes>xzxzx</quotes>], [-1, <quotes>yyyxx</quotes>], [-1, <quotes>yyyyz</quotes>], [-1, <quotes>zzzxx</quotes>], [-1, <quotes>zzzyz</quotes>]], [[1, <quotes>zxzzyz</quotes>], [-1, <quotes>zzxzxy</quotes>]], [[1, <quotes>yzzzxz</quotes>], [-1, <quotes>zxzzyy</quotes>]], [[1, <quotes>yzzzxy</quotes>], [-1, <quotes>zzxzxx</quotes>]], [[1, <quotes>xzzzxz</quotes>], [-1, <quotes>zxyzyz</quotes>]], [[1, <quotes>xyyzyz</quotes>], [1, <quotes>xzxyyx</quotes>], [-1, <quotes>xzxzxy</quotes>], [1, <quotes>xzzzxy</quotes>], [-1, <quotes>yyyxxy</quotes>], [-1, <quotes>zzzxxy</quotes>]], [[1, <quotes>xxzzzy</quotes>], [1, <quotes>xyyyzz</quotes>], [-1, <quotes>xyzyzy</quotes>], [-1, <quotes>xzxyyz</quotes>], [-1, <quotes>xzxzxy</quotes>], [-1, <quotes>xzxzzz</quotes>], [-1, <quotes>xzzzxy</quotes>], [1, <quotes>xzzzzz</quotes>], [-1, <quotes>yyyxxy</quotes>], [-1, <quotes>yyyxzz</quotes>], [-1, <quotes>yyyyzy</quotes>], [-1, <quotes>zzzxxy</quotes>], [-1, <quotes>zzzxzz</quotes>], [-1, <quotes>zzzyzy</quotes>]], [[1, <quotes>xxzzxy</quotes>], [1, <quotes>xyzyxx</quotes>], [1, <quotes>yyyyxx</quotes>], [1, <quotes>zzzyxx</quotes>]]] -------------------------------

### See also