Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2412.07873 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Parking functions correspond with preferences of $n$ cars which enter sequentially to park on a one-way street where (1) each car parks in the first available spot greater than or equal to its preference and (2) all cars successfully park. When a car parks in its preferred spot then the corresponding car and corresponding spot are deemed ``lucky.'' This paper looks briefly at lucky cars which have previously been studied and in simple cases can be understood by a generalization of a result due to Pollak. We also consider lucky spots where the situation is more complex and not previously studied. Probabilities and asymptotics for lucky spots are given for the first few spots on the one-way street. We close with an exploration of the special cases when cars enter the one-way street in either weakly-increasing or weakly-decreasing order of their preferences.