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

Line 3: | Line 3: | ||

<short_description> | <short_description> | ||

Enumerate a (partial) Groebner basis of a finitely generated two-sided ideal in a free monoid ring over the binary field F_{2}={0,1} via the Buchberger procedure. | Enumerate a (partial) Groebner basis of a finitely generated two-sided ideal in a free monoid ring over the binary field F_{2}={0,1} via the Buchberger procedure. | ||

− | |||

− | |||

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

<syntax> | <syntax> | ||

Line 10: | Line 8: | ||

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

<description> | <description> | ||

+ | Given a word ordering <tt>Ordering</tt>, a set <tt>Gb</tt> of non-zero polynomials is called a <em>Groebner basis</em> with respect to <tt>Ordering</tt> if the leading word set <tt>BLW{Gb}</tt> generates the leading word ideal <tt>BLW(<Gb>)</tt>. Note that a two-sided ideal can not have finite Groebner bases. | ||

+ | <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 19:50, 14 May 2013

## NCo.BGB

Enumerate a (partial) Groebner basis of a finitely generated two-sided ideal in a free monoid ring over the binary field F_{2}={0,1} via the Buchberger procedure.

### Syntax

NCo.BGB(G:LIST[, DB:INT, LB:INT, OFlag:INT]):LIST

### Description

Given a word ordering `Ordering`, a set `Gb` of non-zero polynomials is called a *Groebner basis* with respect to `Ordering` if the leading word set `BLW{Gb}` generates the leading word ideal `BLW(<Gb>)`. Note that a two-sided ideal can not have finite Groebner bases.

*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 *alphabet* (or set of indeterminates) `X` and *word ordering* via the functions NCo.SetX and NCo.SetOrdering, respectively, before calling this function. The default ordering is the length-lexicographic ordering ("LLEX"). For more information, please check the relevant functions.

@param

*G:*a LIST of non-zero polynomials generating a two-sided ideal in the free monoid ring`F_{2}<X>`. Each polynomial is represented as a LIST of words (or terms) in`<X>`. Each word is represented as a STRING. For example,`xy^2x`is represented as "xyyx", and the identity is represented as the empty string "". Thus, the polynomial`f=xy-y+1`is represented as F:=["xy", "y", ""]. The zero polynomial`0`is represented as the empty LIST [].@return: a LIST of polynomials, which is a Groebner basis with respect to the current word 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 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

NCo.SetX(<quotes>ab</quotes>); NCo.SetOrdering(<quotes>LLEX</quotes>); F1:=[<quotes>aa</quotes>, <quotes></quotes>]; F2:=[<quotes>bbb</quotes>, <quotes></quotes>]; F3:=[<quotes>abababbabbabababbabb</quotes>, <quotes></quotes>]; G:=[F1,F2,F3]; NCo.BGB(G); [[<quotes>aa</quotes>, <quotes></quotes>], [<quotes>bbb</quotes>, <quotes></quotes>], [<quotes>abbabbabab</quotes>, <quotes>bbabbababa</quotes>] [<quotes>abbabababb</quotes>, <quotes>babbabbaba</quotes>] [<quotes>ababbabbab</quotes>, <quotes>bbabababba</quotes>] [<quotes>abababbabb</quotes>, <quotes>bababbabba</quotes>] [<quotes>babbabbabab</quotes>, <quotes>abbababa</quotes>] [<quotes>ababbabbaba</quotes>, <quotes>bbabababb</quotes>] [<quotes>bbabbabababb</quotes>, <quotes>abbabbaba</quotes>] [<quotes>bbabababbabb</quotes>, <quotes>ababbabba</quotes>] [<quotes>ababbabbabab</quotes>, <quotes>bbababa</quotes>] [<quotes>bababbabbabab</quotes>, <quotes>ababa</quotes>] [<quotes>abababbababab</quotes>, <quotes>babababbababa</quotes>] [<quotes>ababababbabab</quotes>, <quotes>bababbabababa</quotes>] [<quotes>abbababababbab</quotes>, <quotes>babbababababba</quotes>] [<quotes>ababbababababb</quotes>, <quotes>bbababababbaba</quotes>] [<quotes>abababbabbabab</quotes>, <quotes>baba</quotes>] [<quotes>ababababbababa</quotes>, <quotes>bababbababab</quotes>] [<quotes>bbabababbababab</quotes>, <quotes>abababbababa</quotes>] [<quotes>bababbababababb</quotes>, <quotes>ababababbaba</quotes>] [<quotes>ababbababababba</quotes>, <quotes>bbababababbab</quotes>] [<quotes>abababbabbababa</quotes>, <quotes>bab</quotes>] [<quotes>bbabbababababbab</quotes>, <quotes>abbababababba</quotes>] [<quotes>abababbababbabab</quotes>, <quotes>bababbababbababa</quotes>] [<quotes>abababbabbabababb</quotes>, <quotes>ba</quotes>] [<quotes>bbabababbababbabab</quotes>, <quotes>ababbababbababa</quotes>] [<quotes>babbabbabbabbabbab</quotes>, <quotes>abbababababababba</quotes>] [<quotes>abbabbabbabbabbaba</quotes>, <quotes>bbabbababababababb</quotes>] [<quotes>abbababbababbababa</quotes>, <quotes>bababbabababababab</quotes>] [<quotes>abbabababababababb</quotes>, <quotes>babbabababababbaba</quotes>] [<quotes>ababbabababababbab</quotes>, <quotes>bbabababababababba</quotes>] [<quotes>abababbabbabababba</quotes>, <quotes>b</quotes>] [<quotes>bbabbababbababbabab</quotes>, <quotes>ababbababababababa</quotes>] [<quotes>bbabbababababababba</quotes>, <quotes>abbabbabbabbabbab</quotes>] [<quotes>bababbababbababbabb</quotes>, <quotes>abababababababbaba</quotes>] [<quotes>bababbabababababbab</quotes>, <quotes>abababababababba</quotes>] [<quotes>bababbababababababa</quotes>, <quotes>abbababbababbabab</quotes>] [<quotes>ababbababbababbabba</quotes>, <quotes>bbabababababababbab</quotes>] [<quotes>ababbabababababbaba</quotes>, <quotes>bbabababababababb</quotes>] [<quotes>bbabbabababababababb</quotes>, <quotes>abbabababababbaba</quotes>] [<quotes>bbabababababababbaba</quotes>, <quotes>ababbababbababbabb</quotes>] [<quotes>bababbababbababbabba</quotes>, <quotes>abababababababbab</quotes>] [<quotes>abababbabbabababbabb</quotes>, <quotes></quotes>] [<quotes>abbababababababababbab</quotes>, <quotes>babbababababababababba</quotes>] [<quotes>ababbababbabababababab</quotes>, <quotes>bababbababbabababababa</quotes>] [<quotes>ababbababababababababb</quotes>, <quotes>bbababababababababbaba</quotes>] [<quotes>babbababbababbababbabab</quotes>, <quotes>abbabababababababababa</quotes>] [<quotes>bababbababbababbababbab</quotes>, <quotes>ababababababababababba</quotes>] [<quotes>abbababababababababbaba</quotes>, <quotes>babbababababababababb</quotes>] [<quotes>ababbababbababbababbaba</quotes>, <quotes>bbababababababababababb</quotes>] [<quotes>ababbababababababababab</quotes>, <quotes>babbabababababababababa</quotes>] [<quotes>ababababababababababbab</quotes>, <quotes>babababababababababbaba</quotes>] [<quotes>bbabbababababababababbab</quotes>, <quotes>abbababababababababba</quotes>] [<quotes>bbabbabababababababababa</quotes>, <quotes>abbababbababbababbabab</quotes>] [<quotes>bbababababababababababba</quotes>, <quotes>ababbababbababbababbab</quotes>] [<quotes>abbababababababababababb</quotes>, <quotes>babbababbababbababbaba</quotes>] [<quotes>ababababababababababbaba</quotes>, <quotes>babababababababababbab</quotes>] [<quotes>abababababababababababab</quotes>, <quotes>babababababababababababa</quotes>] [<quotes>abbababababababababababab</quotes>, <quotes>babababababababababababba</quotes>] [<quotes>ababababababababababababb</quotes>, <quotes>bbabababababababababababa</quotes>] [<quotes>bbabababababababababababab</quotes>, <quotes>abababababababababababa</quotes>] [<quotes>ababababababababababababba</quotes>, <quotes>bbababababababababababab</quotes>]] -------------------------------

### See also