Combinatorial generalizations and refinements of Euler's partition theorem
| dc.contributor.author | Ndlovu, Miehleketo Brighton | |
| dc.date.accessioned | 2015-05-06T11:25:53Z | |
| dc.date.available | 2015-05-06T11:25:53Z | |
| dc.date.issued | 2015-05-06 | |
| dc.description | A dissertation submitted to the Faculty of Science, University of the Witwatersrand, Johannesburg, in fulfilment of requirements for the degree of Master of Science. 9 December 2014. | |
| dc.description.abstract | The aim of this research project is to survey and elaborate on various generalizations and re nements of Euler's celebrated distinct-odd partition theorem which asserts the equality of the numbers of partitions of a positive integer into distinct summands and into odd summands. Although the work is not originally my own, I give clarity where there is obscurity by bridging the gaps on the already existing work. I touch on combinatorial proofs, which are either bijective or involutive. In some cases I give both combinatorial and analytic proofs. The main source of this dissertation is [22, 5, 6, 8]. I start by rst summarizing some methods and techniques used in partition theory. | en_ZA |
| dc.identifier.uri | http://hdl.handle.net/10539/17641 | |
| dc.language.iso | en | en_ZA |
| dc.subject.lcsh | Partitions (Mathematics) | |
| dc.subject.lcsh | Combinations. | |
| dc.title | Combinatorial generalizations and refinements of Euler's partition theorem | en_ZA |
| dc.type | Thesis | en_ZA |