• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1
  • Tagged with
  • 1
  • 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

The Families with Period 1 of 2-groups of Coclass 3

Smith, Duncan Alexander, Mathematics, UNSW January 2000 (has links)
The 2-groups of coclass 1 are widely known and James (in 1975) looked at the 2-groups of coclass 2. Development of the p-group generation algorithm implemented by O'Brien at ANU enabled group presentations to be provided for the 2-groups of coclass 3 by Newman and O'Brien for groups of order up to 223. Newman and O'Brien (in 1999) conjectured the number of descendants of 2n for all n. They introduced the concept of a family, with each family related to a different pro-p-group and the concept of a sporadic p-group, a p-group external to any family. They found 1782 sporadic 2-groups with order at most 214. The 70 families of 2-groups of coclass 3 can be further split according to their period, a measure of the repetitive structure of the families. Newman and O'Brien conjectured that these families had periods of 1, 2 or 4. This thesis examines the 2-groups of coclass 3 contained in families with period 1 and shows that the number of descendants conjectured by Newman and O'Brien is correct. Furthermore the presentation of all groups contained in period 1 families is provided and shown to be correct.

Page generated in 0.0381 seconds