• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • No language data
  • Tagged with
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Group enumeration

Blackburn, Simon R. January 1992 (has links)
The thesis centres around two problems in the enumeration of p-groups. Define f<sub>φ</sub>(p<sup>m</sup>) to be the number of (isomorphism classes of) groups of order p<sup>m</sup> in an isoclinism class φ. We give bounds for this function as φ is fixed and m varies and as m is fixed and φ varies. In the course of obtaining these bounds, we prove the following result. We say a group is reduced if it has no non-trivial abelian direct factors. Then the rank of the centre Z(P) and the rank of the derived factor group P|P' of a reduced p-group P are bounded in terms of the orders of P|Z(P)P' and P'∩Z(P). A long standing conjecture of Charles C. Sims states that the number of groups of order p<sup>m</sup> is<br/> p<sup><sup>2</sup>andfrasl;<sub>27</sub>m<sup>3</sup>+O(m<sup>2</sup>)</sup>. (1) We show that the number of groups of nilpotency class at most 3 and order p<sup>m</sup> satisfies (1). We prove a similar result concerning the number of graded Lie rings of order p<sup>m</sup> generated by their first grading.

Page generated in 0.0679 seconds