Binary Pullback Parking Functions
In this talk I will introduce parking functions, specifically, the weakly increasing and decreasing binary pullback parking functions. After briefly reviewing the background and motivation for the project, I will present some of the findings from my research over the summer at the Combinatorics and Coding Theory in the Tropics REU at the University of Puerto Rico in Ponce.
My project focused on a generalization known as the (k, l)-pullback parking functions. In this case, each car can park in its preferred spot, k spots behind its preferred spot, or l spots ahead of it. I will then introduce the binary pullback parking functions, a special case that restricts the parameters of the (k, l) pullback parking functions.
The main result of this presentation is the bijection between the weakly increasing and the weakly decreasing binary pullback parking functions, given by a simple formula that acts as a mirror.
MATH 499, Senior Capstone
Connie Wilmarth
10 – 10:25 AM
Goodrich 204