Parking Functions and Related Combinatorial Structures.

dc.contributor.authorRattan, Amarpreeten
dc.date.accessioned2006-08-22T14:23:57Z
dc.date.available2006-08-22T14:23:57Z
dc.date.issued2001en
dc.date.submitted2001en
dc.description.abstractThe 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.formatapplication/pdfen
dc.format.extent609408 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/10012/1028
dc.language.isoenen
dc.pendingfalseen
dc.publisherUniversity of Waterlooen
dc.rightsCopyright: 2001, Rattan, Amarpreet. All rights reserved.en
dc.subjectMathematicsen
dc.subjectparking functionen
dc.subjectnoncrossing partitionen
dc.subjecthyperplane arrangementen
dc.subjecttree inversionen
dc.titleParking Functions and Related Combinatorial Structures.en
dc.typeMaster Thesisen
uws-etd.degreeMaster of Mathematicsen
uws-etd.degree.departmentCombinatorics and Optimizationen
uws.peerReviewStatusUnrevieweden
uws.scholarLevelGraduateen
uws.typeOfResourceTexten

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
arattan2001.pdf
Size:
595.13 KB
Format:
Adobe Portable Document Format