Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2509.05465 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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]$.