The distributions of the entries of Young tableaux (Q1604574)

Fixing a standard Young tableau \(T\) of shape \(\lambda\vdash k\), the authors of this interesting paper compute the probability for a randomly chosen Young tableau of \(n\) cells to contain \(T\). They show that it is equal, in the limit \(n\to\infty\), to \(f^{\lambda}/k!\), where \(f^{\lambda}\) is the number of tableaux of shape \(\lambda\). As a consequence, the authors find the probability for a large tableau to contain an element of a finite collection of Young tableaux. Interesting applications of these results are obtained. In particular, the authors find a rather explicit formula for the probability that a big Young tableau has the letter \(k\) in the \((i,j)\)-position, for fixed \(i,j,k\); the same for a collection of fixed cells that contain prescibed entries. Finally, the paper contains an explicit formula for the number of tableaux of \(n\) cells containing \(k\) as the \((1,2)\)-entry. The proofs are based on the Robinson-Schensted correspondence between the tableaux of \(n\) cells and the involutions of \(n\) letters, translating the problems for tableaux to the corresponding problems for involutions.