Student Combinatorics and Algebra Seminar


Abstract 

The objects we now call parking functions were originally studied by computer scientists to understand the behavior of random hash functions. Since then, they have found a permanent home in algebraic combinatorics because of their connections to hyperplane arrangements, Lagrange inversion, and invariant theory. This talk will take a very biased perspective on parking functions, beginning with their classical definition, and culminating in a hotoffthepresses result that a certain RCAmotivated cyclic action can in some cases be realized combinatorially. 