Non-Commutative Gröbner Bases in Algebras of Solvable Type

We introduce a class of non-commutative polynomial rings over fields intermediate betweencommutative polynomial rings and general non-commutative polynomial rings. This class of solvable polynomial rings includes many rings arising naturally in mathematics and physics, such as iterated Ore extensions of fields and enveloping algebras of finite dimensional Lie algebras. We present algorithms that compute Grobner bases of one- and two-sided ideals in solvable polynomial rings. They extend Buchberger's algorithm (see Buchberger, 1985) in the commutative case and Apel and Lassner's algorithms (see Apel & Lassner, 1988) for one-sided ideals in enveloping algebras of Lie algebras, as well as the results on one-sided standard bases in Weyl algebras, sketched in Galligo (1985). We show that reduced one- and two-sided Grobner bases in solvable polynomial rings are unique, and we solve the word problem and the ideal membership problem for algebras of solvable type, in particular in Clifford algebras. Further applications include the computation of elimination ideals, computing in residue modules and the computation of generators for modules of syzygies.

[1]  Deepak Kapur,et al.  Computing a Gröbner Basis of a Polynomial Ideal over a Euclidean Domain , 1988, J. Symb. Comput..

[2]  Deepak Kapur,et al.  Algorithms for Computing Groebner Bases of Polynomial Ideals over Various Euclidean Rings , 1984, EUROSAM.

[3]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[4]  M. Schützenberger,et al.  Rational sets in commutative monoids , 1969 .

[5]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[6]  G. Bergman.  The diamond lemma for ring theory , 1978 .

[7]  André Galligo,et al.  Some algorithmic questions on ideals of differential operators , 1985 .

[8]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[9]  Volker Weispfennig,et al.  Constructing universal Groebner bases , 1987 .

[10]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[11]  W. Lassner,et al.  Symbol Representations of Noncommutative Algebras , 1985, European Conference on Computer Algebra.

[12]  Ferdinando Mora,et al.  Groebner Bases for Non-Commutative Polynomial Rings , 1985, AAECC.

[13]  B. Buchberger,et al.  Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory , 1985 .

[14]  Joachim Apel,et al.  An Extension of Buchberger's Algorithm and Calculations in Enveloping Fields of Lie Algebras , 1988, J. Symb. Comput..

[15]  Bruno Buchberger,et al.  Some properties of Gröbner-bases for polynomial ideals , 1976, SIGS.

[16]  O. Ore.  Theory of Non-Commutative Polynomials , 1933 .

[17]  William W. Boone.  The Word Problem , 1959 .

[18]  Bruno Buchberger,et al.  Algorithm 628: An algorithm for constructing canonical bases of polynomial ideals , 1985, TOMS.