A Pollak Proof for the Number of Weakly Increasing Parking Functions
Discrete Mathematics & Theoretical Computer Science · 10.04.2026 · vol. 28:1, Permutation... (Special issues)
DOI: 10.46298/dmtcs.17006 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics & Theoretical Computer Science, online erschienen am 10.04.2026. Verfasst von Pamela E. Harris und 2 weiteren Autor:innen.
Abstract (Originalsprache)
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.
Zitieren
APA
Harris, P. E., Mori, J. C. M., & Wilson, A. N. (2026). A Pollak Proof for the Number of Weakly Increasing Parking Functions. Discrete Mathematics & Theoretical Computer Science, vol. 28:1, Permutation...(Special issues). https://doi.org/10.46298/dmtcs.17006
Vancouver
Harris PE, Mori JCM, Wilson AN. A Pollak Proof for the Number of Weakly Increasing Parking Functions. Discrete Mathematics & Theoretical Computer Science. 2026;vol. 28:1, Permutation...(Special issues). doi:10.46298/dmtcs.17006
BibTeX
@article{Harris2026,
author = {Harris, Pamela E. and Mori, J. Carlos Martínez and Wilson, Alexander N.},
title = {A Pollak Proof for the Number of Weakly Increasing Parking Functions},
journal = {Discrete Mathematics & Theoretical Computer Science},
year = {2026},
volume = {vol. 28:1, Permutation...},
number = {Special issues},
doi = {10.46298/dmtcs.17006}
}
EUVIMED