Non-commutative Gröbner bases in algebras of solvable type

  • Authors:

  • A. Kandri-Rody;V. Weispfenning

  • Affiliations:

  • Départment des Mathématiques, Université Cadi Ayyad, Marrakech, Morocco;Lehrstuhl für Mathematik, Universität Passau, D-8390 Passau, FRG

  • Venue:
  • Journal of Symbolic Computation
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.