Genus one partitions
| dc.contributor.author | Yip, Martha | en |
| dc.date.accessioned | 2007-05-08T14:01:22Z | |
| dc.date.available | 2007-05-08T14:01:22Z | |
| dc.date.issued | 2006 | en |
| dc.date.submitted | 2006 | en |
| dc.description.abstract | We obtain a tight upper bound for the genus of a partition, and calculate the number of partitions of maximal genus. The generating series for genus zero and genus one rooted hypermonopoles is obtained in closed form by specializing the genus series for hypermaps. We discuss the connection between partitions and rooted hypermonopoles, and suggest how a generating series for genus one partitions may be obtained via the generating series for genus one rooted hypermonopoles. An involution on the poset of genus one partitions is constructed from the associated hypermonopole diagrams, showing that the poset is rank-symmetric. Also, a symmetric chain decomposition is constructed for the poset of genus one partitions, which consequently shows that it is strongly Sperner. | en |
| dc.format | application/pdf | en |
| dc.format.extent | 608255 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/10012/2933 | |
| dc.language.iso | en | en |
| dc.pending | false | en |
| dc.publisher | University of Waterloo | en |
| dc.rights | Copyright: 2006, Yip, Martha. All rights reserved. | en |
| dc.subject | Mathematics | en |
| dc.subject | partition | en |
| dc.subject | genus | en |
| dc.subject | permutation | en |
| dc.subject | hypermonopole | en |
| dc.subject | generating series | en |
| dc.subject | poset | en |
| dc.subject | rank-symmetric | en |
| dc.subject | symmetric chain order | en |
| dc.title | Genus one partitions | en |
| dc.type | Master Thesis | en |
| uws-etd.degree | Master of Mathematics | en |
| uws-etd.degree.department | Combinatorics and Optimization | en |
| uws.peerReviewStatus | Unreviewed | en |
| uws.scholarLevel | Graduate | en |
| uws.typeOfResource | Text | en |
Files
Original bundle
1 - 1 of 1