arXiv (All)
open access
Distribution of the inversion statistic on run-sorted permutations
Let $π=π_1\cdots π_n$ be a permutation. We say that $π$ is $run$-$sorted$ if $π_1=1$ and the entries immediately following the descent positions of $π$ 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 nu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Real-rooted Eulerian polynomials from permutations, words, and paths#975372
- Descent generating polynomials for ($n-3$)- and ($n-4$)-stack-sortable (pattern-avoiding) permutations#1082938
- Distribution of maxima and minima statistics on alternating permutations, Springer numbers, and avoidance of flat POPs#677335
- Distribution of maxima and minima statistics on alternating permutations, Springer numbers, and avoidance of flat POPs#674138
- A Quadratic Lower Bound for the Shield Number of the Stable Marriage Problem: Rearrangement, Extremal Construction, and Biclique Realizability#1123783
Record · ID 1076330
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive