A Study of Polya's Enumeration Theorem
| Metadata Field | Value | Language |
|---|---|---|
| dc.contributor.advisor | Slaminka, Edward | |
| dc.contributor.advisor | Harris, Greg | en_US |
| dc.contributor.advisor | Baldwin, Stewart | en_US |
| dc.contributor.author | Williams, Elizabeth | en_US |
| dc.date.accessioned | 2008-09-09T21:21:57Z | |
| dc.date.available | 2008-09-09T21:21:57Z | |
| dc.date.issued | 2005-08-15 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10415/712 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en_US | en_US |
| dc.subject | Mathematics and Statistics | en_US |
| dc.title | A Study of Polya's Enumeration Theorem | en_US |
| dc.type | Thesis | en_US |
| dc.embargo.length | NO_RESTRICTION | en_US |
| dc.embargo.status | NOT_EMBARGOED | en_US |