English

Parking functions with zero secondary dinv

Combinatorics 2025-09-09 v1

Abstract

We show that the number of parking functions of length nn with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of [n][n].

Cite

@article{arxiv.2509.05465,
  title  = {Parking functions with zero secondary dinv},
  author = {Susanna Fishel and Luis Pena},
  journal= {arXiv preprint arXiv:2509.05465},
  year   = {2025}
}
R2 v1 2026-07-01T05:23:50.400Z