[Paper Review] Noncommutative Involutive Bases

Gareth A. Evans|ArXiv.org|Feb 7, 2006

Polynomial and algebraic computation38 references3 citations

TL;DR

This paper introduces noncommutative involutive bases as a generalization of Gröbner bases to noncommutative polynomial rings, presenting new algorithms for computing them using strong, weak, global, and local involutive divisions. The key contribution is a provably correct algorithm that computes a noncommutative Gröbner basis via involutive reduction, with termination ensured by introducing stability and extendibility properties for involutive divisions.

ABSTRACT

The theory of Groebner Bases originated in the work of Buchberger 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 Groebner Basis, and indeed in finding alternative methods of computing Groebner Bases. Two of these methods include the Groebner Walk method and the computation of Involutive Bases. By the mid 1980's, Buchberger's work had been generalised for noncommutative polynomial rings by Bergman and Mora. This thesis provides the corresponding generalisation for Involutive Bases and (to a lesser extent) the Groebner Walk, with the main results being as follows. (1) Algorithms for several new noncommutative involutive divisions are given, including strong; weak; global and local divisions. (2) 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 Groebner Basis on termination. (3) An algorithm for a noncommutative Groebner 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. (4) 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.

Motivation & Objective

• To extend the theory of involutive bases from commutative to noncommutative polynomial rings.
• To develop new algorithms for computing noncommutative involutive bases using various involutive divisions.
• To generalize the Gröbner walk and involutive walk to noncommutative settings under harmonious monomial orderings.
• To establish theoretical properties—stability and extendibility—that ensure termination and applicability of homogeneous methods in noncommutative settings.

Proposed method

• Proposes four new noncommutative involutive divisions: strong, weak, global, and local, based on overlap conditions and multiplicative variables.
• Develops an algorithm for computing noncommutative involutive bases using these divisions, with involutive reduction and prolongation steps.
• Introduces the concept of harmonious monomial orderings to enable conversion between orderings in noncommutative Gröbner and involutive walks.
• Applies the notion of continuity and conclusivity to ensure correctness and termination of the involutive basis computation.
• Uses a modified version of Buchberger’s algorithm adapted for noncommutative settings, with criteria for reduction and S-polynomial handling.
• Implements and tests the algorithm using ANSI C and AlgLib, with source code provided in Appendix B for reproducibility.

Experimental results

Research questions

• RQ1 Can involutive basis theory be successfully generalized to noncommutative polynomial rings?
• RQ2 What types of involutive divisions are suitable for noncommutative settings, and how do they ensure termination and correctness?
• RQ3 Can the Gröbner walk be extended to noncommutative rings, and under what conditions does it preserve involutive structure?
• RQ4 What properties—such as stability and extendibility—are necessary to guarantee termination and homogeneous method applicability in noncommutative involutive bases?
• RQ5 How do different noncommutative involutive divisions compare in terms of computational efficiency and basis size?

Key findings

• The proposed algorithm for noncommutative involutive bases correctly computes a Gröbner basis upon termination when using any of the new involutive divisions.
• The introduction of stability and extendibility ensures termination and enables the use of homogeneous methods in noncommutative settings.
• The noncommutative Gröbner walk algorithm is valid for conversion between two harmonious monomial orderings, generalizing the commutative case.
• The noncommutative involutive walk algorithm is also valid under the same conditions, preserving the involutive structure during basis conversion.
• An implementation in ANSI C with AlgLib successfully computes involutive and reduced Gröbner bases, as demonstrated on test cases including ideal membership problems.
• The system correctly identifies membership of polynomials in ideals, such as verifying that $ zyx + 1 $ and $ xz^2 + yz^2 - 1 $ are in the ideal generated by $ \{x+y+z-3, x^2+y^2+z^2-9, x^3+y^3+z^3-24\} $, while $ x^{10} $ is not.