A generalization of Gröbner basis algorithms to polycyclic group rings (Q1382039): Difference between revisions

Group rings are the subject of extensive studies in mathematics. In 1981 Baumslag, Cannonito and Miller showed that for an integral group ring of a polycyclic group, i.e., a group with a finite subnormal series with cyclic factors, several decision problems including the membership problem for submodules are computable. Studying these ideas Sims described how the connections between special submodule bases enable the membership problem and conventional Gröbner bases to be solved. In this paper we present our results which generalize reduction and Gröbner bases to polycyclic group rings. We want to point out that instead of using the fact that every group ring over a polycyclic group is Noetherian, our approach is oriented towards rewriting which leads to a syntactical characterization of Gröbner bases in terms of \(s\)-polynomials and a completion-based algorithm with which to compute them.