MRC -- data structures and procedures for computing in monoid and group rings

DOI10.1007/s002000050122zbMath0960.16055OpenAlexW2063917820MaRDI QIDQ1304766

Dirk Zeckzer, Birgit Reinert

Publication date: 6 February 2001

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000050122

zbMATH Keywords

Gröbner basesgroup ringsmonoid ringsBuchberger's algorithmprefix reduction

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordinary and skew polynomial rings and semigroup rings (16S36) Group rings (16S34) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Semigroup rings, multiplicative semigroups of rings (20M25) Computational aspects of associative rings (general theory) (16Z05)

Related Items (5)

Some complexity results for prefix Gröbner bases in free monoid rings ⋮ Coset Enumeration Using Prefix Gröbner Bases: An Experimental Approach ⋮ One-sided noncommutative Gröbner bases with applications to computing Green's relations ⋮ MRC ⋮ Regular Gröbner bases

Uses Software

• LEDA

This page was built for publication: MRC -- data structures and procedures for computing in monoid and group rings