Momputing Grobner Bases by FGLM Techniques in a Non-commutative Setting

摘要

A generalization of the FGLM technique is given to compute Grobner bases for two-sided ideals of free finitely generated algebras. Specializations of this algorithm are presented for the cases in which the ideals is determined by either functioals or monoid (group) pre- sentations. Generalizations are discussed in order to compute Grobner bases on (twisted) semigroup rings.