Parking Functions and Related Combinatorial Structures.
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.
Collections
Cite this version of the work
Amarpreet Rattan
(2001).
Parking Functions and Related Combinatorial Structures.. UWSpace.
http://hdl.handle.net/10012/1028
Other formats