q-analog of tableau containment

DOI10.1016/J.JCTA.2010.08.011MaRDI QIDQ2431262zbMATH OpenOpenAlexFDO

Authors Jang Soo Kim

Publication date 11 April 2011

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0812.1256

zbMATH Keywords

\(q\)-analogpermutation containmenttableau containment

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of partitions of integers (05A17) Combinatorial aspects of representation theory (05E10)

Abstract: 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 $lambdavdashk$ 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.

Recommendations

• The distributions of the entries of Young tableaux
• Asymptotics for the distributions of subtableaux in Young and up-down tableaux
• A q-analog of the hook walk algorithm for random Young tableaux
• On the enumeration of skew Young tableaux
• A \(q\)-analog of the hook walk algorithm and random Young tableaux

Cites work

• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 3766017 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1033382 (Why is no real title available?)
• scientific article; zbMATH DE number 2107707 (Why is no real title available?)
• Overpartitions
• Permutation statistics and partitions
• Robinson-Schensted algorithms for skew tableaux
• Subsequence containment by involutions
• The distributions of the entries of Young tableaux
• The initial involution patterns of permutations

Cited in

(4)

• A q-analog of the hook walk algorithm for random Young tableaux
• The distributions of the entries of Young tableaux
• Periodic P-partitions
• Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles

This page was built for publication: \(q\)-analog of tableau containment

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2431262)