An algorithm for constructing Gröbner and free Schreier bases in free group algebras (Q1329181)

Given a set \(S\) of \(n\) elements in a free group algebra, each of degree at most \(d\), this paper presents an algorithm for computing a canonical Schreier basis of free generators, as well as a Gröbner basis, for the finitely generated one-sided ideal determined by \(S\). At each stage in the algorithm there are at most \(2n\) polynomials, each of degree at most \(d + 1\). A special case of this procedure yields an algorithm similar to the Nielsen-Hall algorithm for constructing free bases for subgroups of free groups.