A Study of Polya's Enumeration Theorem
Date
2005-08-15Type of Degree
ThesisDepartment
Mathematics and Statistics
Metadata
Show full item recordAbstract
The controversial lemma, known most commonly as Burnside's Lemma, is stated and proven. The influential Polya's Enumeration Theorem is stated and proven. Computations using Polya's Enumeration Theorem are discussed and examples of these computations are given.