Metraipolis › archive › dc_2dae9853c871

Distribution of the inversion statistic on run-sorted permutations — arXiv:2609.28674

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.28674
License (as archived)
CC0-1.0
Archived
2026-10-08T06:36:37.296Z
SHA-256 of the archived text
d184632b8523812814f66e57b8cb3d7fdf739063e2257030ac665b96eea988fe
Stable URL of this page
https://metraipolis.com/documento/dc_2dae9853c871

How to cite

Distribution of the inversion statistic on run-sorted permutations — arXiv:2609.28674 — arXiv (en), https://arxiv.org/abs/2609.28674 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2dae9853c871 (Metraipolis archive dc_2dae9853c871, sha256 d184632b8523812814f66e57b8cb3d7fdf739063e2257030ac665b96eea988fe)
BibTeX
@misc{dc2dae9853c871,
  title = {Distribution of the inversion statistic on run-sorted permutations — arXiv:2609.28674},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.28674},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2dae9853c871; sha256 d184632b8523812814f66e57b8cb3d7fdf739063e2257030ac665b96eea988fe},
  year = {2026}
}

Archived text

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

Let $\pi=\pi_1\cdots \pi_n$ be a permutation. We say that $\pi$ is $run$-$sorted$ if $\pi_1=1$ and the entries immediately following the descent positions of $\pi$ form an increasing sequence. Let $\mathcal{R}_n$ denote the set of run-sorted permutations of length $n$, which has cardinality given by the Bell number $B_{n-1}$ for all $n \geq 1$. In this paper, we consider the joint distribution $A_n(q,u)$ on $\mathcal{R}_n$ for the parameters tracking the numbers of inversions and runs leading to a new polynomial generalization of the Bell numbers. Among our results, we find a general recurrence for $A_n(q,u)$, from which one may derive explicit formulas for the total numbers of inversions or runs in all the members of $\mathcal{R}_n$ as well as for the sign-balance on $\mathcal{R}_n$ of either parameter. A simple expression for the Eulerian generating function for $A_n(q,1)$ may be found upon making use of Gessel's $q$-exponential formula which can be extended to general $u$. Finally, a formula is found by a direct argument for the maximum number of inversions within a member of $\mathcal{R}_n$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.28674 — 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-08T06:02:10.002Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).