Burnside's Lemma, mathematics, Polia Enumeration, Sylow p-subgroups, M.C. Escher paintings
Applied Mathematics | Mathematics | Physical Sciences and Mathematics
Throughout my time at the University of Redlands, I have been drawn towards areas of math that are abstract. I enjoy knowing that an equation made up of completely abstract ideas can can be used to solve real world problems in a variety of subjects other than math.
This paper covers Burnside's Lemma including a proof and a variety of examples. It culminates with counting the number of unique Escher paintings that can be made. Also within this paper are discussion and proofs about both Polia Enumeration and Sylow p-subgroups.
Department 1 Awarding Honors Status
Hernandez, B. (2013). Burnside's Lemma (Undergraduate honors thesis, University of Redlands). Retrieved from https://inspire.redlands.edu/cas_honors/483
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial 4.0 License