This analysis shows that the count of parking functions matching zero secondary dinv equals the count of ordered cycle decompositions of permutations.
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]$.
No takes yet. Share an insight, caveat, or question.
Fishel et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: