Skip to main content
SpringerLink
Log in

MRC– Data Structures and Procedures for Computing in Monoid and Group Rings

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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 1.0 together with some examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Kaiserslautern, D-67663 Kaiserslautern, Germany (e-mail: reinert,zeckzer@informatik.uni-kl.de), , , , , , DE

    Birgit Reinert & Dirk Zeckzer

Authors
  1. Birgit Reinert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dirk Zeckzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received July 24, 1998; revised version March 4, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reinert, B., Zeckzer, D. MRC– Data Structures and Procedures for Computing in Monoid and Group Rings. AAECC 10, 41–78 (1999). https://doi.org/10.1007/s002000050122

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000050122

Search

Navigation