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

From ApCoCoAWiki
← Older editNewer edit →
No edit summary
No edit summary
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 M presented by a string rewriting system, let <math>\mathbb{Q}</math>[M] denote the ring of all finite formal sums (called polynomials)  
For the field of rationals <math>\mathbb{Q}</math> and a monoid M presented by a string rewriting system, let <math>\mathbb{Q}</math>[M] denote the ring of all finite formal sums (called polynomials) <math>\sum^{n}_{i=1}a_{i}\cdot w_{i}</math>  
 
<math>M</math>


{{ApCoCoAServer}}
{{ApCoCoAServer}}
[[Category:ApCoCoA_Manual]]
[[Category:ApCoCoA_Manual]]

Revision as of 09:03, 9 July 2009

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

For the field of rationals ℚ and a monoid M presented by a string rewriting system, let ℚ[M] denote the ring of all finite formal sums (called polynomials) ∑i=1nai⋅wi

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 "https://app.apcocoa.uni-passau.de/wiki/index.php?title=Category:ApCoCoA-1:Package_gbmr&oldid=9829"