<p>The <strong class="pkg">IBNP</strong> package provides methods for computing an involutive (Gröbner) basis <span class="SimpleMath">\(B\)</span> for an ideal <span class="SimpleMath">\(J\)</span> over a polynomial ring <span class="SimpleMath">\(\mathbb{R}\)</span> in both the commutative and noncommutative cases. Secondly, methods are provided to involutively reduce a given polynomial to its normal form in <span class="SimpleMath">\(\mathbb{R}/J\)</span>.</p>
<p>This package was started using <strong class="pkg">GAP</strong> 4.13.1 and first released with <strong class="pkg">GAP</strong> 4.15.0.</p>
<p>The package may be obtained as a compressed <code class="code">.tar</code> file <code class="file">IBNP-0.16.tar.gz</code> from the GitHub release site: <span class="URL"><a href="https://github.com/gap-packages/ibnp/releases/tag/v0.16">https://github.com/gap-packages/ibnp/releases/tag/v0.16</a></span>. The package also has a GitHub repository at: <span class="URL"><a href="https://github.com/gap-packages/ibnp">https://github.com/gap-packages/ibnp</a></span>.</p>
<p>Once the package is loaded, the manual <code class="code">doc/manual.pdf</code> can be found in the documentation folder. The <code class="code">html</code> versions, with or without MathJax, may be rebuilt as follows:</p>
<p>It is possible to check that the package has been installed correctly by running the test files (this terminates the <strong class="pkg">GAP</strong> session):</p>
<p>The theoretical basis behind this package is the Ph.D. thesis "Noncommutative Involutive Bases" of Gareth Evans in 2005 <a href="chapBib_mj.html#biBgareth-thesis">[Eva05]</a>. (The main concepts and results may also be found in the papers <a href="chapBib_mj.html#biBBeaumont">[Eva70]</a> and <a href="chapBib_mj.html#biBEW-JSC">[EW07]</a>.) We quote here the summary from that thesis.</p>
<p><em>The theory of Gröbner Bases originated in the work of Buchberger <a href="chapBib_mj.html#biBbuchberger">[Buc98]</a> and is now considered to be one of the most important and useful areas of symbolic computation. A great deal of effort has been put into improving Buchberger's algorithm for computing a Gröbner Basis, and indeed in finding alternative methods of computing Gröbner Bases. Two of these methods include the Gröbner Walk method [AGK97] and the computation of Involutive Bases [ZB96].
<p><em>By the mid 1980's, Buchberger's work had been generalised for noncommutative polynomial rings by Bergman <a href="chapBib_mj.html#biBbergman">[Ber78]</a> and Mora <a href="chapBib_mj.html#biBmora">[Mor86]</a>. This thesis provides the corresponding generalisation for Involutive Bases and (to a lesser extent) the Gröbner Walk, with the main results being as follows. </em></p>
<ul>
<li><p><em>Algorithms for several new noncommutative involutive divisions are given, including strong; weak; global and local divisions.</em></p>
</li>
<li><p><em>An algorithm for computing a noncommutative Involutive Basis is given. When used with one of the aforementioned involutive divisions, it is shown that this algorithm returns a noncommutative Gröbner Basis on termination.</em></p>
</li>
<li><p><em>An algorithm for a noncommutative Gröbner Walk is given, in the case of conversion between two harmonious monomial orderings. It is shown that this algorithm generalises to give an algorithm for performing a noncommutative Involutive Walk, again in the case of conversion between two harmonious monomial orderings.</em></p>
</li>
<li><p><em>Two new properties of commutative involutive divisions are introduced (stability and extendibility), respectively ensuring the termination of the Involutive Basis algorithm and the applicability (under certain conditions) of homogeneous methods of computing Involutive Bases.</em></p>
</li>
</ul>
<p><em>Sourcecode for an initial implementation of an algorithm to compute noncommutative Involutive Bases is provided in Appendix B. This sourcecode, written using ANSI C and a series of libraries (AlgLib) provided by MSSRC forms part of a larger collection of programs providing examples for this thesis, including implementations of the commutative and noncommutative Gröbner Basis algorithms <a href="chapBib_mj.html#biBbuchberger">[Buc98]</a>, <a href="chapBib_mj.html#biBmora">[Mor86]</a>; the commutative Involutive Basis algorithm for the Pommaret and Janet involutive divisions <a href="chapBib_mj.html#biByuyu">[ZB96]</a>; and the Knuth-Bendix critical pairs completion algorithm for monoid rewrite systems <a href="chapBib_mj.html#biBknuth-bendix">[KB04]</a>.</em></p>
<p>The implementations described in the last paragraph formed a package <em>Involutive</em> in 2005. This was based on libraries developed by the <em>Multidisciplinary Software Systems Research Corporation</em> (MSSRC) which apparently no longer exists. This software was provided for the research by Larry Lambe who was an Honorary Professor in the Mathematics Department at Bangor at that time. (For an example of his work, see <a href="chapBib_mj.html#biBlambe-radford">[LR97]</a>.)</p>
<p>It has long been our intention to make these algorithms available to the wider symbolic computation community, and this <strong class="pkg">GAP</strong> package is the result. Involutive Bases are constructed, but Gröbner Walks will have to wait until a later version. In place of the AlgLib library functions we use the noncommutative polynomial operations provided by the <strong class="pkg">GBNP</strong> <a href="chapBib_mj.html#biBGBNP">[CK24]</a> package.</p>
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung ist noch experimentell.
