Show simple item record

Files in this item


Item metadata

dc.contributor.advisorRobertson, E. F.
dc.contributor.authorWegner, Alexander
dc.coverage.spatial130, 11 p.en_US
dc.description.abstractComputational group theory deals with the design, analysis and computer implementation of algorithms for solving computational problems involving groups, and with the applications of the programs produced to interesting questions in group theory, in other branches of mathematics, and in other areas of science. This thesis describes an implementation of a proposal for a Soluble Quotient Algorithm, i.e. a description of the algorithms used and a report on the findings of an empirical study of the behaviour of the programs, and gives an account of an application of the programs. The programs were used for the construction of soluble groups with interesting properties, e.g. for the construction of soluble groups of large derived length which seem to be candidates for groups having efficient presentations. New finite soluble groups of derived length six with trivial Schur multiplier and efficient presentations are described. The methods for finding efficient presentations proved to be only practicable for groups of moderate order. Therefore, for a given derived length soluble groups of small order are of interest. The minimal soluble groups of derived length less than or equal to six are classified.en_US
dc.publisherUniversity of St Andrews
dc.subject.lcshGroup theory--Data processingen
dc.subject.lcshFinite groupsen
dc.subject.lcshPresentation of groups (Mathematics)en
dc.titleThe construction of finite soluble factor groups of finitely presented groups and its applicationen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US

This item appears in the following Collection(s)

Show simple item record