Preference-restricted parking functions
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913943509794816 |
|---|---|
| author | Bown, Jasper Kagey, Peter Kappler, Alan Orrison, Michael E. Thadani, Jayden |
| author_facet | Bown, Jasper Kagey, Peter Kappler, Alan Orrison, Michael E. Thadani, Jayden |
| contents | A parking function is a function $π:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking functions, which are parking functions with codomain restricted to some $S\subseteq[n]$. Particular choices of $S$ yield new combinatorial interpretations of previous results about variant parking procedures, and new results too. In particular we consider prime parking functions, parking procedures with fewer spots than cars, and parking functions where each spot has space for multiple cars. We also use restricted parking functions to reprove Abel's binomial theorem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_11701 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Preference-restricted parking functions Bown, Jasper Kagey, Peter Kappler, Alan Orrison, Michael E. Thadani, Jayden Combinatorics 05A19 (primary), 05A05, 05A15 (secondary) A parking function is a function $π:[n]\to [n]$ whose $i$th-smallest output is at most $i,$ corresponding to a parking procedure for $n$ cars on a one-way street. We refine this concept by introducing preference-restricted parking functions, which are parking functions with codomain restricted to some $S\subseteq[n]$. Particular choices of $S$ yield new combinatorial interpretations of previous results about variant parking procedures, and new results too. In particular we consider prime parking functions, parking procedures with fewer spots than cars, and parking functions where each spot has space for multiple cars. We also use restricted parking functions to reprove Abel's binomial theorem. |
| title | Preference-restricted parking functions |
| topic | Combinatorics 05A19 (primary), 05A05, 05A15 (secondary) |
| url | https://arxiv.org/abs/2507.11701 |