Central extensions of polycyclic groups
There are two main results contained in this dissertation. T he first result is a description of an algorithm for the computation of polycyclic presentations for nilpotent factor groups of a given finitely presented group. T his algorithm is a generalization of the methods employed in the p -quotient algorithm (Havas & Newman, 1980) to possibly infinite nilpotent groups. T he second is a method for the computation of the Schur multiplicator of a group given by a polycyclic presentation and a...[Show more]
|Collections||Open Access Theses|
|b18583799_Nickel_Werner.pdf||13.11 MB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.