A Pollak Proof for the Number of Weakly Increasing Parking Functions
Abstract
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.
Fields of Study & Subjects
Stochastic processes and statistical mechanics
Advanced Combinatorial Mathematics
Limits and Structures in Graph Theory
Publication details
- Journal / source
- Discrete Mathematics & Theoretical Computer Science
- Volume
- vol. 28:1, Permutation...
- Issue
- Special issues
- Publication date
- 10 April 2026
- Language
- EN