arXiv Analytics

Sign in

arXiv:0812.1256 [math.CO]AbstractReferencesReviewsResources

q-analog of tableau containment

Jang Soo Kim

Published 2008-12-06, updated 2010-11-02Version 2

We prove a $q$-analog of the following result due to McKay, Morse and Wilf: the probability that a random standard Young tableau of size $n$ contains a fixed standard Young tableau of shape $\lambda\vdash k$ tends to $f^{\lambda}/k!$ in the large $n$ limit, where $f^{\lambda}$ is the number of standard Young tableaux of shape $\lambda$. We also consider the probability that a random pair $(P,Q)$ of standard Young tableaux of the same shape contains a fixed pair $(A,B)$ of standard Young tableaux.

Comments: 20 pages, to appear J. Combin. Theory. Ser. A
Journal: J. Combin. Theory Ser. A 118 (2011) 1021-1038
Categories: math.CO
Subjects: 05A15, 05A30
Related articles: Most relevant | Search more
arXiv:math/0505080 [math.CO] (Published 2005-05-04, updated 2006-01-26)
Conway's napkin problem
arXiv:0811.0949 [math.CO] (Published 2008-11-06, updated 2009-11-30)
On percolation and the bunkbed conjecture
arXiv:2004.01659 [math.CO] (Published 2020-04-03)
Shuffling and $P$-partitions