Spring, Thursdays, Blocker 506A, 4:00-4:50 PM

Date: April 20

"  Mutually Assured Parking "
  Westin King  


Classical parking functions have seen uses in topics ranging from trees, to chip firing, to maximal chain labeling and have several generalizations. In this talk, I will generalize the notion of parking functions to directed graphs and demonstrate an extension of a 2016 result by Lackner and Panholzer concerning the number of parking functions on trees and mappings. Additionally, I will discuss some interesting restrictions and will give a bijection between a family of lattice paths in Z^2 and special parking functions on certain caterpillar graphs.