The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram (Q2135139)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram |
scientific article |
Statements
The limiting distribution of the hook length of a randomly chosen cell in a random Young diagram (English)
0 references
4 May 2022
0 references
A partition \(\lambda\) of a positive integer \(n\) is a non-increasing sequence \((\lambda_1, \lambda_2,\ldots,\lambda_k)\) whose sum is \(n\). Let \(\Lambda(n)\) be the set of all partitions of \(n\) and \(p(n)=|\Lambda(n)|\). The Young diagram of a partition is a left-justified array of boxes or cells in the plane, with \(\lambda_i\) cells in the \(i\)th row counting from the bottom. A cell in row \(i\) (counting from bottom) and column \(j\) (counting from left) is labeled \((i,j)\). Reading consecutively the numbers of cells in the columns of the array of the partition \(\lambda\), we get the conjugate partition \(\lambda^{*}=(\lambda_1^{*},\lambda_2^{*},\ldots,\lambda_l^{*})\), where \(l=\lambda_1\). The hook length \(h(\lambda,c)\) of the cell \(c=(i,j)\) in partition \(\lambda\) is the number of cells in the hook comprised of the \((i,j)\)-cell itself and the cells in the \(i\)th row to the right of \((i,j)\) and in the \(j\)th column above \((i,j)\). That is, \(h(\lambda,c)=\lambda_i-j+\lambda_j^{*}-i+1\). In the paper under review, the authors study the hook length statistic produced by a random selection of a cell in a random Young diagram. The sampling procedure contains two steps: first select a partition \(\lambda\in \Lambda(n)\) uniformly at random and then select a cell \(c=(i,j)\in\lambda\) uniformly at random. The sampling procedure leads to the product probability space \[ \Omega(n)=\Lambda(n)\times \{c\in\lambda: \lambda\in\Lambda(n)\} \] and the product probability measure \(\mathbb{P}(\cdot)\) defined by \[ \mathbb{P}((\lambda,c)\in \Omega(n))=\frac{1}{np(n)}. \] For any pair \((\lambda,c)\in \Omega(n)\), denote the underlying hook length by \[ Z_n=Z_n(\lambda,c):=h(\lambda,c). \] The authors study the asymptotic distribution of the hook length \(Z_n\). Explicitly, they prove that for \(0<y<\infty\), \[ \lim_{n\rightarrow \infty}\mathbb{P}\left(\frac{\pi Z_n}{\sqrt{6n}}\leq y\right)=\frac{6}{\pi^2}\int_0^y \frac{u}{e^u-1}du. \] Their method is based on Hayman's saddle point approach for admissible power series.
0 references
integer partition
0 references
Young diagram
0 references
hook length
0 references
limiting distribution
0 references
0 references
0 references
0 references