Lara Pudwell, Valparaiso University

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 enumeration results that were conjectured and/or proved collaboratively with the computer. This project is joint work with Ayomikun Adeniran.

Link to video: https://vimeo.com/677935664

Presented Via Zoom: https://rutgers.zoom.us/j/94346444480

Password: 6564120420

For further information see: https://sites.math.rutgers.edu/~zeilberg/expmath/