Subscribe to Events

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.

Zoom link: https://rutgers.zoom.us/j/94346444480
password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420