Computing presentations for finite soluble groups
Download (7.34 MB)
-
Altmetric Citations
Description
The work in this thesis was carried out in the area of computational group theory. The latter is concerned with designing algorithm s and developing their practical implementations for investigating problem s regarding groups. An important class of groups are finite soluble groups. These can be described in a computationally convenient way by power conjugate presentations. In practice, however, they are usually supplied differently. The aim of this thesis is to propose algorithm s for...[Show more]
Collections | Open Access Theses |
---|---|
Date published: | 1993 |
Type: | Thesis (PhD) |
URI: | http://hdl.handle.net/1885/133191 |
DOI: | 10.25911/5d723bf24f10e |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
b18567964_Niemeyer_Alice_C.pdf | 7.34 MB | Adobe PDF |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator