Parking functions with zero secondary dinv
Susanna Fishel, Luis Pena
Published: 2025/9/5
Abstract
We show that the number of parking functions of length $n$ with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of $[n]$.