Pattern-avoiding parking functions

Abstract:

We extend the classical definition of patterns in permutations to parking functions. In particular we study parking functions that avoid permutations of length 3. A number of well-known combinatorial sequences arise in our analysis, and this talk will highlight several bijective results. This project is joint work with Ayomikun Adeniran.

Note: This talk begins with a pre-seminar (aimed at graduate students) at 3:30–4:00. The main talk starts at 4:10.

Join Zoom Meeting: https://washington.zoom.us/j/91547335974
Meeting ID: 915 4733 5974