Year: 2026
Type: preprint
Abstract: A parking function is said to have $\ell$-limited preferences if there are at most $\ell$ copies of each element in the parking function. In this paper, we define a notion of pattern avoidance for parking functions and enumerate those $2$-limited parking functions that avoid certain patterns.
Source: arXiv (Cornell University)
Authors: Archer, Kassie, Laudone, Robert
Institution: United States Naval Academy
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7220381053