Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2412.07873 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866912151827906560 |
|---|---|
| author | Butler, Steve Hadaway, Kimberly Lenius, Victoria Martens, Preston Moats, Marshall |
| author_facet | Butler, Steve Hadaway, Kimberly Lenius, Victoria Martens, Preston Moats, Marshall |
| 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_07873 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Lucky cars and lucky spots in parking functions Butler, Steve Hadaway, Kimberly Lenius, Victoria Martens, Preston Moats, Marshall Combinatorics Probability 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. |
| title | Lucky cars and lucky spots in parking functions |
| topic | Combinatorics Probability |
| url | https://arxiv.org/abs/2412.07873 |