Parking Functions and Related Combinatorial Structures.
dc.contributor.author | Rattan, Amarpreet | en |
dc.date.accessioned | 2006-08-22T14:23:57Z | |
dc.date.available | 2006-08-22T14:23:57Z | |
dc.date.issued | 2001 | en |
dc.date.submitted | 2001 | en |
dc.description.abstract | The central topic of this thesis is parking functions. We give a survey of some of the current literature concerning parking functions and focus on their interaction with other combinatorial objects; namely noncrossing partitions, hyperplane arrangements and tree inversions. In the final chapter, we discuss generalizations of both parking functions and the above structures. | en |
dc.format | application/pdf | en |
dc.format.extent | 609408 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/10012/1028 | |
dc.language.iso | en | en |
dc.pending | false | en |
dc.publisher | University of Waterloo | en |
dc.rights | Copyright: 2001, Rattan, Amarpreet. All rights reserved. | en |
dc.subject | Mathematics | en |
dc.subject | parking function | en |
dc.subject | noncrossing partition | en |
dc.subject | hyperplane arrangement | en |
dc.subject | tree inversion | en |
dc.title | Parking Functions and Related Combinatorial Structures. | 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