Metraipolis › archive › dc_fe782a14a3bf

Symmetries on vector parking functions via bounded lattice paths — arXiv:2610.05665

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.05665
License (as archived)
CC0-1.0
Archived
2026-10-06T16:52:08.091Z
SHA-256 of the archived text
499e5d029c801b985748ab9df304cc19492bc28f58392aef64987a53f8ebde06
Stable URL of this page
https://metraipolis.com/documento/dc_fe782a14a3bf

How to cite

Symmetries on vector parking functions via bounded lattice paths — arXiv:2610.05665 — arXiv (en), https://arxiv.org/abs/2610.05665 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fe782a14a3bf (Metraipolis archive dc_fe782a14a3bf, sha256 499e5d029c801b985748ab9df304cc19492bc28f58392aef64987a53f8ebde06)
BibTeX
@misc{dcfe782a14a3bf,
  title = {Symmetries on vector parking functions via bounded lattice paths — arXiv:2610.05665},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.05665},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fe782a14a3bf; sha256 499e5d029c801b985748ab9df304cc19492bc28f58392aef64987a53f8ebde06},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.05665. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Partly motivated by enumeration of parking functions and their variants, there is a long-standing interest in lattice paths refined by several statistics, including the notable $\mathsf{run}$ and $\mathsf{return}$. We consider bounded lattice paths, which are bounded by a given lattice path and are related to vector parking functions, for which we generalize $\mathsf{run}$ to composition runs, parameterized by a composition. By constructing involutions on these paths, we establish symmetries relating composition runs to some generalized return statistics. As an application, we settle an open problem of Dai, Fu, and Qiu on rational Dyck paths. The symmetries between generalized $\mathsf{run}$ and $\mathsf{return}$ are then transferred to vector parking functions, which suggest a new notion of prime decomposition. In the special case of $(a, b)$-parking functions, we compute the generating function refined by $\mathsf{run}$ and $\mathsf{pri}$, which is new even for classical parking functions.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.05665 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T15:19:20.003Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).