Parking functions were introduced during the research of hash functions as a presentation of the way they function. Since then, researchers encounter them in various areas, in their base and generalized forms. In this thesis we present parking functions and their connections with other areas. We discuss their relationship with Prüfer code and labeled trees. We also explore bijections with lattice of noncrossing partitions, allowed input-output pairs in a priority queue and Shi arrangement. For a graphical presentation of parking functions, we describe them via labeled Dyck paths. We count parking functions with a given final arrangement. In the end, we present u-parking functions, that are a generalization, and count them with the help of the parking polytope.
|
