Parking functions with zero secondary dinv
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908522113925120 |
|---|---|
| author | Fishel, Susanna Pena, Luis |
| author_facet | Fishel, Susanna Pena, Luis |
| 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]$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_05465 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Parking functions with zero secondary dinv Fishel, Susanna Pena, Luis Combinatorics 05A15 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]$. |
| title | Parking functions with zero secondary dinv |
| topic | Combinatorics 05A15 |
| url | https://arxiv.org/abs/2509.05465 |