MRC - data structures and procedures for computing in monoid and group rings. 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.
Keywords for this software
References in zbMATH (referenced in 4 articles , 1 standard article )
Showing results 1 to 4 of 4.
- Sattler-Klein, Andrea: Some complexity results for prefix Gröbner bases in free monoid rings (2010)
- Månsson, Jonas; Nordbeck, Patrik: Regular Gröbner bases (2002)
- Heyworth, Anne: One-sided noncommutative Gröbner bases with applications to computing Green’s relations (2001)
- Reinert, Birgit; Zeckzer, Dirk: MRC -- data structures and procedures for computing in monoid and group rings (1999)