Search arXivSearch

arXiv · 2605.00378

Explicit marginal distributions for permutations with prescribed Robinson-Schensted shape

Abstract

Given a permutation $σ$, the Robinson-Schensted correspondence determines a certain partition called the shape of $σ$. Famously, the shape measures the longest unions of increasing and decreasing subsequences, thus giving global information about $σ$. In this paper, by contrast, we ask how prescribing a shape collectively controls local behavior: namely, if $σ$ is a random permutation of shape $λ$, then what is $P^λ_{ij} :=$ the probability that $σ(i) = j$? Using tableau-theoretic methods, we derive explicit formulas for $P^λ_{ij}$ when $λ$ is a hook, two-row, or rectangular shape. We use these formulas to depict and analyze the intricate diffraction-like patterns in the matrices $(P^λ_{ij})$. As a surprising application, we show that for both hook and two-row shapes, as the largest part of $λ$ tends to infinity with the remaining parts fixed (summing to $m$), the expected proportion of fixed points in $σ$ approaches the Wallis integral $\int_0^{π/2} \sin^{2m+1} x \: dx = (2m)!! / (2m+1)!!$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

William Q. Erickson. 2026-05-11. Explicit marginal distributions for permutations with prescribed Robinson-Schensted shape. https://arxiv.org/abs/2605.00378

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO