A Short Proof that the number of $(a,b)$-parking functions of length n $a(a+bn)^{n-1}$
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916537500172288 |
|---|---|
| author | Bu, AJ Zeilberger, Doron |
| author_facet | Bu, AJ Zeilberger, Doron |
| contents | We give a very short proof of the fact that the number of $(a,b)$-parking functions of length $n$ equals $a(a+bn)^{n-1}$. This was first proved in 2003 by Kung and Yan, via a very long and torturous route, as a corollary of a more general result. This new version contains a reference to previous work kindly communicated by Richard Stanley |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_11222 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Short Proof that the number of $(a,b)$-parking functions of length n $a(a+bn)^{n-1}$ Bu, AJ Zeilberger, Doron Combinatorics We give a very short proof of the fact that the number of $(a,b)$-parking functions of length $n$ equals $a(a+bn)^{n-1}$. This was first proved in 2003 by Kung and Yan, via a very long and torturous route, as a corollary of a more general result. This new version contains a reference to previous work kindly communicated by Richard Stanley |
| title | A Short Proof that the number of $(a,b)$-parking functions of length n $a(a+bn)^{n-1}$ |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2412.11222 |