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 Q and a monoid M presented by a string rewriting system, let Q[M] denote the ring of all finite formal sums (called polynomials) a_1 w_1+ a_2 w_2 +...+a_n w_n
  
 
{{ApCoCoAServer}}
 
{{ApCoCoAServer}}
 
[[Category:ApCoCoA_Manual]]
 
[[Category:ApCoCoA_Manual]]

Revision as of 09:39, 9 July 2009

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

For the field of rationals Q and a monoid M presented by a string rewriting system, let Q[M] denote the ring of all finite formal sums (called polynomials) a_1 w_1+ a_2 w_2 +...+a_n w_n

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=9831"