The Distributions of the Entries of Young Tableaux
β Scribed by Brendan D. McKay; Jennifer Morse; Herbert S. Wilf
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 109 KB
- Volume
- 97
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
Let T be a standard Young tableau of shape l * k. We show that the probability that a randomly chosen Young tableau of n cells contains T as a subtableau is, in the limit n Q ., equal to f l /k!, where f l is the number of all tableaux of shape l. 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.
π SIMILAR VOLUMES
Recently a relationship was discovered between the number of permutations of \(n\) letters that have no increasing subsequence of length \(>k\), on the one hand, and the number of Young tableaux of \(n\) cells whose first row is of length \(\leq k\), on the other. The proof seemed quite unmotivated
A generalization of the notion of standard Young tableau has recently arisen from work on the representation theory of affine Hecke algebras. In the generalized setting, a standard tableau is defined to be any element of a finite Weyl group whose inversion set satisfies a certain pair of intersectio