Parking functions with zero secondary dinv
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].
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.