Combinatorics & algebra seminar-Enumerating Pattern Avoiding Parking Functions
Tuesday, March 31, 2026
4:00 pm - 5:00 pm
Title: Enumerating Pattern Avoiding Parking Functions
Speaker: Ben Adenbaum, Villanova
Date and time: Tuesday, March 31, 4–5 pm
Place: Rome 206
Abstract: We complete the enumeration of the number of parking functions of length n avoiding, in the sense defined by Qiu and Remmel, a single permutation of length 3 answering several questions of Adeniran and Pudwell. Additionally, we provide explicit growth rates for the number of parking functions of length n avoiding a single monotonic pattern of any length. As a consequence of our techniques, we additionally provide an enumeration for the number of equivalence classes of words with a fixed content under the Sylvester congruence.
Date and time: Tuesday, March 31, 4–5 pm
Place: Rome 206
Abstract: We complete the enumeration of the number of parking functions of length n avoiding, in the sense defined by Qiu and Remmel, a single permutation of length 3 answering several questions of Adeniran and Pudwell. Additionally, we provide explicit growth rates for the number of parking functions of length n avoiding a single monotonic pattern of any length. As a consequence of our techniques, we additionally provide an enumeration for the number of equivalence classes of words with a fixed content under the Sylvester congruence.