MRC - Data Structures and Algorithms for Computing in Monoid and Group Rings
Applicable Algebra in Engineering, Communications and Computing, to appear

Abstract:
Gröbner bases and Buchberger's algorithm have been generalized to monoid and group rings. In this paper we present the data structures and procedures we used to implement in a first step the concept of prefix reduction in the system MRC together with some examples.

Birgit Reinert, Dirk Zeckzer
Fachbereich Informatik
Postfach 3049
67653 Kaiserslautern, Germany

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