Files in this item
Some group presentations with few defining relations
Item metadata
dc.contributor.advisor | Campbell, C. M. (Colin Matthew) | |
dc.contributor.author | Gill, David Michael | |
dc.coverage.spatial | 81 p. | en_US |
dc.date.accessioned | 2018-09-04T13:53:51Z | |
dc.date.available | 2018-09-04T13:53:51Z | |
dc.date.issued | 1990 | |
dc.identifier.uri | https://hdl.handle.net/10023/15964 | |
dc.description.abstract | We consider two classes of groups with two generators and three relations. One class has a similar presentation to groups considered in the paper by C.M. Campbell and R.M. Thomas, ‘On (2,n)-Groups related to Fibonacci Groups’, (Israel J. Math., 58), with one generator of order three instead of order two . We attempt to find the order of these groups and in one case find groups which have the alternating group A₅ as a subgroup of index equal to the order of the second generator of the group. Questions remain as to the order of some of the other groups. The second class has already been considered in the paper 'Some families of finite groups having two generators and two relations' by C.M. Campbell , H.S.M. Coxeter and E.F. Robertson, (Proc. R. Soc. London A. 357, 423-438 (1977)), in which a formula for the orders of these groups was found. We attempt to find simpler formulae based on recurrence relations for subclasses and write Maple programs to enable us to do this. We also find a formula, again based on recurrence relations, for an upper bound for the orders of the groups. | en_US |
dc.language.iso | en | en_US |
dc.publisher | University of St Andrews | |
dc.subject.lcc | QA171.G5 | |
dc.subject.lcsh | Presentations of groups (Mathematics) | en |
dc.title | Some group presentations with few defining relations | en_US |
dc.type | Thesis | en_US |
dc.type.qualificationlevel | Masters | en_US |
dc.type.qualificationname | MSc Master of Science | en_US |
dc.publisher.institution | The University of St Andrews | en_US |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.