Back to search

University of Waterloo

The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability

Abstract

dc:description.abstract

The O'Nan-Scott Theorem classifies finite primitive permutation groups into one of five isomorphism classes. This theorem is very useful for answering questions about finite permutation groups since four out of the five isomorphism classes are well understood. The proof of this theorem currently relies upon the classification of the finite simple groups, as it requires a consequence of this classification, the Schreier Conjecture. After reviewing some needed group theoretic concepts, I give a detailed proof of the O'Nan-Scott Theorem. I then examine how the techniques of this proof have been applied to an open problem which asks whether every finite lattice can be embedded as an interval into the subgroup lattice of a finite group.

Degree

thesis:*
Grantor dc:publisher
University of Waterloo
Year dc:date.issued
2009

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Fawcett, Joanna

Subjects

dc:subject × 4

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/10012/4534

Chain of custody

source
Harvested from
University of Waterloo
Base URL
dspacemainprd01.lib.uwaterloo.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Fawcett, Joanna. The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability. University of Waterloo, 2009. http://hdl.handle.net/10012/4534