Skip navigation
Skip navigation

Computing presentations for finite soluble groups

Niemeyer, Alice C


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]

CollectionsOpen Access Theses
Date published: 1993
Type: Thesis (PhD)


File Description SizeFormat Image
b18567964_Niemeyer_Alice_C.pdf7.34 MBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator