Parking functions with zero secondary dinv
Preprint
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]$.
Keywords
All Related Versions
This publication has 1 reference indexed in Scilit:
- Rooted forests that avoid sets of permutationsEuropean Journal of Combinatorics, 2019