Category:ApCoCoA-1:Package gbmr

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

For the field of rationals ${\displaystyle \mathbb{\mathbb{Q}}}$ and a monoid ${\displaystyle {ℳ}}$ presented by a string rewriting system, let ${\displaystyle \mathbb{\mathbb{Q}}[{ℳ}]}$ denote the ring of all finite formal sums (called polynomials) ${\displaystyle {\displaystyle \sum _{i=1}^n}{a}_i\cdot w_i}$ with coefficients ${\displaystyle a_i\in \mathbb{\mathbb{Q}}\setminus \{0\}}$ and terms ${\displaystyle w_i\in {ℳ}}$. This ring is called the monoid ring of ${\displaystyle {ℳ}}$ over ${\displaystyle {𝒬}}$ .

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.