# Category:ApCoCoA-1:Package gbmr

Package gbmr is designed to compute Groebner bases in monoid rings.

For the field of rationals ${\displaystyle \mathbb {Q} }$ and a monoid M presented by a string rewriting system, let ${\displaystyle \mathbb {Q} [M]}$ denote the ring of all finite formal sums (called polynomials)

Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.