Difference between revisions of "Category:ApCoCoA-1:Package gbmr"

From ApCoCoAWiki
Line 1: Line 1:
 
Package gbmr is designed to compute Groebner bases in monoid rings.
 
Package gbmr is designed to compute Groebner bases in monoid rings.
  
−
For the field of rationals <math>\mathbb{Q}</math> and a monoid <math>\mathcal{M}</math> presented by a string rewriting system, let <math>\mathbb{Q}[\mathcal{M}]</math> denote the ring of all finite formal sums (called polynomials) <math>\sum^{n}_{i=1}a_{i}\cdot w_{i}</math> with coefficients <math>a_{i}\in\mathbb{Q}\setminus\{0\}</math> and terms <math>w_{i}\in\mathcal{M}</math>. This ring is called the monoid ring of <math>\mathcal{M}</math> over <math>\mathcal{Q}</math> .
+
For the field of rationals <math>\mathbb{Q}</math> and a monoid <math>M</math>  
  
  

Revision as of 08:57, 9 July 2009

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

For the field of rationals and a monoid


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.

Retrieved from "http://apcocoa.uni-passau.de/wiki/index.php?title=Category:ApCoCoA-1:Package_gbmr&oldid=9823"