Undergraduate Thesis Or Project

 

Burnside's Theorem Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/undergraduate_thesis_or_projects/5x21tg13g

Descriptions

Attribute NameValues
Creator
Abstract
  • Just as prime numbers can be thought of as the building blocks of the natural numbers, in a similar fashion, simple groups may be considered the building blocks of finite groups. Burnside considered the following questions: 1. Do there exist non-abelian simple groups of odd order? 2. Do there exist non-abelian simple groups whose orders are divisible by fewer than three distinct primes? In 1904, Burnside answered question 2 when he used representation theory to prove that groups whose orders have exactly two prime divisors are solvable. His proof is a clever application of representation theory, and while purely group-theoretic proofs do exist, they are longer and more difficult than Burnside's original proof. This paper presents a representation theoretic proof of Burnside's Theorem, providing sufficient background information in group theory and the representation theory of finite groups, and then gives a brief outline of a group theoretic proof.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Keyword
Rights Statement
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2011-02-10T22:14:36Z (GMT). No. of bitstreams: 1 Burnside's Theorem.pdf: 245498 bytes, checksum: 3711a82b72d038318d8e873dfb76ad43 (MD5) Previous issue date: 2010-04
  • description.provenance : Submitted by Kevin Campbell (kevin.campbell@oregonstate.edu) on 2011-02-09T21:57:27Z No. of bitstreams: 1 Burnside's Theorem.pdf: 245498 bytes, checksum: 3711a82b72d038318d8e873dfb76ad43 (MD5)
  • description.provenance : Approved for entry into archive by Sue Kunda(sue.kunda@oregonstate.edu) on 2011-02-10T22:14:36Z (GMT) No. of bitstreams: 1 Burnside's Theorem.pdf: 245498 bytes, checksum: 3711a82b72d038318d8e873dfb76ad43 (MD5)

Relationships

Parents:

This work has no parents.

Items