The distributions of the entries of Young tableaux
u(pi(T^*))/k!, where pi(T^*) is the shape (= Ferrers diagram) of T^* and
u(pi) is the number of all tableaux of shape pi. In other words, the probability that a large tableau contains T^* is equal to the number of tableaux whose shape is that of T^*, divided by k!. We give several applications, to the probabilities that a set of prescribed entries will appear in a set of prescribed cells of a tableau, and to the probabilities that subtableaux of given shapes will occur. Our argument rests on a notion of quasirandomness of families of permutations, and we give sufficient conditions for this to hold. We then extend these results by finding an explicit formula for the limiting probability that a Young tableau has a given set of entries in a given set of positions. The result is that the limiting probability that a Young tableau has a prescribed set of entries k_1,k_2,..., k_m in a prescribed set of m cells is equal to the sum of the measures of all tableaux on K cells (K=max{{k_i}}) that have the given entries in the given positions, where the measure of a tableau of K cells is the number of tableaux of its shape divided by K!. In the proof we also develop conditions that ensure the quasirandomness of certain families of permutations.
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.
- Probabilities in the \((k,l)\) hook
- On the enumeration of skew Young tableaux
- On descents in standard Young tableaux
- Skew Howe duality and random rectangular Young tableaux
- Quasirandom permutations
- On the distribution of the number of Young tableaux for a uniformly random diagram
- Periodic P-partitions
- On the distribution of the major index on standard Young tableaux
- Another probabilistic method in the theory of Young tableaux
- Quasirandom permutations are characterized by 4-point densities
- Asymptotics for the distributions of subtableaux in Young and up-down tableaux
- \(q\)-analog of tableau containment
- Limit shapes for random square Young tableaux
- Descent functions and random Young tableaux
- Asymptotics for skew standard Young tableaux via bounds for characters
- Random Young tableaux and combinatorial identities
- Experimenting with standard Young tableaux
- Periodic Pólya urns, the density method and asymptotics of Young tableaux
This page was built for publication: The distributions of the entries of Young tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1604574)
