A Pollak Proof for the Number of Weakly Increasing Parking Functions
Fuente:
arXiv
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911592720891904 |
|---|---|
| author | Harris, Pamela E. Mori, J. Carlos Martínez Wilson, Alexander N. |
| author_facet | Harris, Pamela E. Mori, J. Carlos Martínez Wilson, Alexander N. |
| contents | We develop a circular-street argument, in the style of Pollak, to obtain a new proof that there are $C_n = \frac{1}{n+1}\binom{2n}{n}$ weakly increasing parking functions of length $n \geq 1$, where $C_n$ is the $n$th Catalan number. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_20796 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Pollak Proof for the Number of Weakly Increasing Parking Functions Harris, Pamela E. Mori, J. Carlos Martínez Wilson, Alexander N. Combinatorics 05A15 We develop a circular-street argument, in the style of Pollak, to obtain a new proof that there are $C_n = \frac{1}{n+1}\binom{2n}{n}$ weakly increasing parking functions of length $n \geq 1$, where $C_n$ is the $n$th Catalan number. |
| title | A Pollak Proof for the Number of Weakly Increasing Parking Functions |
| topic | Combinatorics 05A15 |
| url | https://arxiv.org/abs/2511.20796 |