Difference between revisions of "ApCoCoA-1:NCo.TruncatedGB"

From ApCoCoAWiki
m (replaced <quotes> tag by real quotes)
 
(4 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 +
{{Version|1}}
 
<command>
 
<command>
 
<title>NCo.TruncatedGB</title>
 
<title>NCo.TruncatedGB</title>
Line 5: Line 6:
 
</short_description>
 
</short_description>
 
<syntax>
 
<syntax>
NCo.TruncatedGB(G:LIST, DB:INT[, LB:INT, OFlag:INT]):LIST
+
NCo.TruncatedGB(G:LIST, DB:INT):LIST
 
</syntax>
 
</syntax>
 
<description>
 
<description>
Line 12: Line 13:
 
<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 environment <em>coefficient field</em> <tt> K</tt>, <em>alphabet</em> (or set of indeterminates) <tt>X</tt> and <em>ordering</em> via the functions <ref>NCo.SetFp</ref>, <ref>NCo.SetX</ref> and <ref>NCo.SetOrdering</ref>, respectively, before using this function. The default coefficient field is <tt>Q</tt>, and the default ordering is the length-lexicographic ordering (<quotes>LLEX</quotes>). For more information, please check the relevant functions.
+
Please set ring environment <em>coefficient field</em> <tt> K</tt>, <em>alphabet</em> (or set of indeterminates) <tt>X</tt> and <em>ordering</em> via the functions <ref>ApCoCoA-1:NCo.SetFp|NCo.SetFp</ref>, <ref>ApCoCoA-1:NCo.SetX|NCo.SetX</ref> and <ref>ApCoCoA-1:NCo.SetOrdering|NCo.SetOrdering</ref>, respectively, before using this function. The default coefficient field is <tt>Q</tt>, and the default ordering is the length-lexicographic ordering ("LLEX"). For more information, please check the relevant functions.
 
<itemize>
 
<itemize>
<item>@param <em>G</em>: a LIST of non-zero homogeneous polynomials generating a two-sided ideal in <tt>K&lt;X&gt;</tt>. Each polynomial is represented as a LIST of monomials, which are LISTs of the form [C, W] where W is a word in <tt>&lt;X&gt;</tt> and C is the coefficient of W. For example, the polynomial <tt>f=xy-y+1</tt> is represented as F:=[[1,<quotes>xy</quotes>], [-1, <quotes>y</quotes>], [1,<quotes></quotes>]].</item>
+
<item>@param <em>G</em>: a LIST of non-zero homogeneous polynomials generating a two-sided ideal in <tt>K&lt;X&gt;</tt>. Each polynomial is represented as a LIST of monomials, which are LISTs of the form [C, W] where W is a word in <tt>&lt;X&gt;</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>@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>
 
<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>
  
 
<item>@return: a LIST of polynomials, which is a truncated Groebner basis at degree DB with respect to the current word ordering if the enumerating procedure doesn't terminate due to reaching the loop bound LB, and is a partial Groebner basis otherwise.</item>
 
<item>@return: a LIST of polynomials, which is a truncated Groebner basis at degree DB with respect to the current word ordering if the enumerating procedure doesn't terminate due to reaching the loop bound LB, and is a partial Groebner basis otherwise.</item>
</itemize>
 
About 2 optional parameters: in some situations, truncated Groebner basis is too large for our applications. Thus, instead of computing the whole truncated Groebner basis, the function uses two optional parameters to control the enumerating procedure. Note that at the moment <em>all</em> of the following 2 optional parameters must be used at the same time.
 
<itemize>
 
<item>@param <em>LB:</em> 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.</item>
 
 
<item>@param <em>OFlag:</em> 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.</item>
 
 
</itemize>
 
</itemize>
 
<example>
 
<example>
NCo.SetX(<quotes>xyz</quotes>);
+
NCo.SetX("xyz");
F1:=[[1,<quotes>yxy</quotes>],[-1,<quotes>zyz</quotes>]];
+
F1:=[[1,"yxy"],[-1,"zyz"]];
F2:=[[1,<quotes>xyx</quotes>],[-1,<quotes>zxy</quotes>]];
+
F2:=[[1,"xyx"],[-1,"zxy"]];
F3:=[[1,<quotes>zxz</quotes>],[-1,<quotes>yzx</quotes>]];
+
F3:=[[1,"zxz"],[-1,"yzx"]];
F4:=[[1,<quotes>xxx</quotes>],[1,<quotes>yyy</quotes>],[1,<quotes>zzz</quotes>],[1,<quotes>xyz</quotes>]];
+
F4:=[[1,"xxx"],[1,"yyy"],[1,"zzz"],[1,"xyz"]];
 
G:=[F1,F2,F3,F4];
 
G:=[F1,F2,F3,F4];
 
NCo.TruncatedGB(G,6);
 
NCo.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, "yzx"], [-1, "zxz"]], [[1, "yxy"], [-1, "zyz"]], [[1, "xyx"], [-1, "zxy"]], [[1, "xxx"], [1, "xyz"], [1, "yyy"], [1, "zzz"]],  
[[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, "zxzy"], [-1, "zzxz"]], [[1, "xzyz"], [-1, "zxyy"]], [[1, "xxyz"], [1, "xyyy"], [-1, "xzxz"], [1, "xzzz"], [-1, "yyyx"],  
[-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, "zzzx"]], [[1, "zzxyy"], [-1, "zzxzz"]], [[1, "yzzxz"], [-1, "zxzzy"]], [[1, "yzzxy"], [-1, "zzxzx"]], [[1, "yzyyy"],  
[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, "yzzzz"], [1, "zxzxx"], [1, "zzxzz"]], [[1, "yxzxz"], [-1, "zyzzx"]], [[1, "xzzxz"], [-1, "zxyyx"]], [[1, "xyyyy"], [1, "xyzzz"],  
[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, "zxyyz"], [1, "zzzxy"]], [[1, "xxzxz"], [1, "xyyyx"], [-1, "xzxzx"], [1, "xzzzx"], [-1, "yyyxx"], [-1, "zzzxx"]], [[1, "xxzxy"],  
[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, "xyzyx"], [1, "yyyyx"], [1, "zzzyx"]], [[1, "xxyyy"], [1, "xxzzz"], [-1, "xyzyz"], [-1, "xzxzx"], [-1, "yyyxx"], [-1, "yyyyz"],  
[-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, "zzzxx"], [-1, "zzzyz"]], [[1, "zxzzyz"], [-1, "zzxzxy"]], [[1, "yzzzxz"], [-1, "zxzzyy"]], [[1, "yzzzxy"], [-1, "zzxzxx"]],  
[[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, "xzzzxz"], [-1, "zxyzyz"]], [[1, "xyyzyz"], [1, "xzxyyx"], [-1, "xzxzxy"], [1, "xzzzxy"], [-1, "yyyxxy"], [-1, "zzzxxy"]],  
[[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, "xxzzzy"], [1, "xyyyzz"], [-1, "xyzyzy"], [-1, "xzxyyz"], [-1, "xzxzxy"], [-1, "xzxzzz"], [-1, "xzzzxy"], [1, "xzzzzz"],  
[-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, "yyyxxy"], [-1, "yyyxzz"], [-1, "yyyyzy"], [-1, "zzzxxy"], [-1, "zzzxzz"], [-1, "zzzyzy"]], [[1, "xxzzxy"], [1, "xyzyxx"],  
[1, <quotes>yyyyxx</quotes>], [1, <quotes>zzzyxx</quotes>]]]
+
[1, "yyyyxx"], [1, "zzzyxx"]]]
 
-------------------------------
 
-------------------------------
 
</example>
 
</example>
 
</description>
 
</description>
 
<seealso>
 
<seealso>
<see>NCo.GB</see>
+
<see>ApCoCoA-1:NCo.GB|NCo.GB</see>
<see>NCo.IsGB</see>
+
<see>ApCoCoA-1:NCo.IsGB|NCo.IsGB</see>
<see>NCo.LW</see>
+
<see>ApCoCoA-1:NCo.LW|NCo.LW</see>
<see>NCo.ReducedGB</see>
+
<see>ApCoCoA-1:NCo.ReducedGB|NCo.ReducedGB</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.SetX</see>
+
<see>ApCoCoA-1:NCo.SetX|NCo.SetX</see>
<see>Introduction to CoCoAServer</see>
+
<see>ApCoCoA-1:Introduction to CoCoAServer|Introduction to CoCoAServer</see>
 
</seealso>
 
</seealso>
 
<types>
 
<types>
Line 67: Line 62:
 
<key>NCo.TruncatedGB</key>
 
<key>NCo.TruncatedGB</key>
 
<key>TruncatedGB</key>
 
<key>TruncatedGB</key>
<wiki-category>Package_gbmr</wiki-category>
+
<wiki-category>ApCoCoA-1:Package_gbmr</wiki-category>
 
</command>
 
</command>

Latest revision as of 13:45, 29 October 2020

This article is about a function from ApCoCoA-1.

NCo.TruncatedGB

Compute a truncated Groebner basis of a finitely generated homogeneous two-sided ideal in a free monoid ring.

Syntax

NCo.TruncatedGB(G:LIST, DB:INT):LIST

Description

Given a word ordering and a homogeneous two-sided ideal I, a set of non-zero polynomials G is called a Groebner basis of I if the leading word set LW{G} generates the leading word ideal LW(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 G | 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.

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 ring environment coefficient field K, alphabet (or set of indeterminates) X and ordering via the functions NCo.SetFp, NCo.SetX and NCo.SetOrdering, respectively, before using this function. The default coefficient field is Q, and the default ordering is the length-lexicographic ordering ("LLEX"). For more information, please check the relevant functions.

  • @param G: a LIST of non-zero homogeneous polynomials generating a two-sided ideal in K<X>. Each polynomial is represented as a LIST of monomials, which are LISTs 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,""]].

  • @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.

  • @return: a LIST of polynomials, which is a truncated Groebner basis at degree DB with respect to the current word ordering if the enumerating procedure doesn't terminate due to reaching the loop bound LB, and is a partial Groebner basis otherwise.

Example

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

See also

NCo.GB

NCo.IsGB

NCo.LW

NCo.ReducedGB

NCo.SetFp

NCo.SetOrdering

NCo.SetX

Introduction to CoCoAServer