A polycyclic quotient algorithm (Q1382042)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polycyclic quotient algorithm |
scientific article; zbMATH DE number 1136612
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polycyclic quotient algorithm |
scientific article; zbMATH DE number 1136612 |
Statements
A polycyclic quotient algorithm (English)
0 references
15 February 1999
0 references
An algorithm to compute polycyclic quotients of a group given by a finite presentation is discussed. The algorithm is based on a generalization of the Gröbner basis method to the integral group ring of a polycyclic group. Most of this material can be found in the author's thesis (Rutgers Univ., 1996). A simplified version of this paper is also available [in DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 28, 159-167 (1997; Zbl 0874.20020)].
0 references
algorithms
0 references
polycyclic quotients
0 references
finite presentations
0 references
Gröbner bases
0 references
integral group rings
0 references
polycyclic groups
0 references
