On some discrete statistics of parking functions

Ari Cruz, Pamela E. Harris, Kimberly J. Harry +5

Recall that $\hat{I}\pm =(a_1,a_2,\dots ,a_n)\in [n{]}^n$ is a parking function if its nondecreasing rearrangement ${\hat{I}}^2=(b_1,b_2,\dots ,b_n)$ satisfies $b_i\le i$ for all $1\le i\le n$. In t…