ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let λ=(λ1,…,λr)∈Λm\lambda=(\lambda_1,\ldots,\lambda_r)\in\Lambda_m be a Young diagram with λ1\lambda_1 boxes in its first row, and let λ(n)\lambda^{(n)} be obtained by adding a first row of nn boxes, where n≥λ1n\geq\lambda_1. Let km+n+(λ(n))\mathbf{k}_{m+n}^{+}(\lambda^{(n)}) and km+n−(λ(n))\mathbf{k}_{m+n}^{-}(\lambda^{(n)}) count the Kostant-positive and Kostant-negative permutations in Sm+n\mathrm S_{m+n} of shape λ(n)\lambda^{(n)}, respectively, and let SYTm+n(λ(n))\mathtt{SYT}_{m+n}(\lambda^{(n)}) denote the standard Young tableaux of that shape. Asymptotic Shape Conjecture. For every m≥0m\geq0 and λ∈Λm\lambda\in\Lambda_m, the proportion of permutations of shape λ(n)\lambda^{(n)} that are Kostant positive satisfies

km+n+(λ(n))∣SYTm+n(λ(n))∣2=km+n+(λ(n))km+n+(λ(n))+km+n−(λ(n))⟶1\frac{\mathbf{k}_{m+n}^{+}(\lambda^{(n)})}{|\mathtt{SYT}_{m+n}(\lambda^{(n)})|^2}=\frac{\mathbf{k}_{m+n}^{+}(\lambda^{(n)})}{\mathbf{k}_{m+n}^{+}(\lambda^{(n)})+\mathbf{k}_{m+n}^{-}(\lambda^{(n)})}\longrightarrow1

as n≥λ1n\geq\lambda_1 tends to infinity. This was known for fully commutative permutations, equivalently one-row shapes, and the paper proves it for shapes (1,1)(1,1) and (2,1)(2,1); the general assertion remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.