Category:ApCoCoA-1:Package gbmr

From ApCoCoAWiki
Revision as of 08:56, 9 July 2009 by (talk)

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

For the field of rationals and a monoid presented by a string rewriting system, let denote the ring of all finite formal sums (called polynomials) with coefficients and terms . This ring is called the monoid ring of over .

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.