q-analog of tableau containment
Jang Soo Kim

TL;DR
This paper introduces a q-analog of a classical probability result about Young tableaux, analyzing the asymptotic likelihood of containing fixed subtableaux in large random tableaux.
Contribution
It extends classical tableau containment probabilities to a q-analog setting, providing new asymptotic results for random Young tableaux.
Findings
The probability tends to f^{mbda}/k! as n grows large.
Established a q-analog of the classical containment probability result.
Analyzed the probability for pairs of tableaux containing fixed pairs.
Abstract
We prove a -analog of the following result due to McKay, Morse and Wilf: the probability that a random standard Young tableau of size contains a fixed standard Young tableau of shape tends to in the large limit, where is the number of standard Young tableaux of shape . We also consider the probability that a random pair of standard Young tableaux of the same shape contains a fixed pair of standard Young tableaux.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Mathematical Dynamics and Fractals · Random Matrices and Applications
