An algorithm for constructing Gröbner and free Schreier bases in free group algebras (Q1329181)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for constructing Gröbner and free Schreier bases in free group algebras |
scientific article |
Statements
An algorithm for constructing Gröbner and free Schreier bases in free group algebras (English)
0 references
1 December 1994
0 references
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.
0 references
free group algebra
0 references
algorithm
0 references
Schreier basis
0 references
free generators
0 references
Gröbner basis
0 references
finitely generated one-sided ideal
0 references
free bases
0 references
free groups
0 references