Introducing Reduction to Polycyclic Group Rings - A Comparison of Methods
Reports on Computer Algebra No 9. Centre of Computer Algebra. Universität Kaiserslautern. 1996. (Gzippped Postscript, 200 Kbytes, 52 pp)

Abstract:
It is well-known that for the integral group ring of a polycyclic group several decision problems are decidable.In this paper a technique to solve the membership problem for right ideals originating from Baumslag, Cannonito and Miller and studied by Sims is outlined. We want to analyze, how these decision methods are related to Gröbner bases. Therefore, we define effective reduction for group rings over Abelian groups, nilpotent groups and more general polycyclic groups. Using these reductions we present generalizations of Buchberger's Groebner basis method by giving an appropriate definition of ``Gröbner bases'' in the respective setting and by characterizing them using concepts of saturation and s-polynomials.

Birgit Reinert
Fachbereich Informatik
Postfach 3049
67653 Kaiserslautern, Germany

reinert@informatik.uni-kl.de
back to publications 1996