Diagonal sequences of integer partitions
For a natural number \(n\), let \(\mathcal{P}(n)\) be the set of unrestricted partitions of \(n\). For \(\tilde{\alpha} = (\alpha_1,\ldots,\alpha_{\ell})\in\mathcal{P}(n)\), where \(\alpha_1 \geq \alpha_2 \geq \cdots \geq \alpha_{\ell}\geq 1\) are natural numbers with \(\sum_{i=1}^{\ell}\alpha_i = n\), define the diagonal sequence \(\delta(\tilde{\alpha}) = (d_1(\tilde{\alpha}),d_2(\tilde{\alpha}),\ldots)\) by \(d_k(\tilde{\alpha}) = |\{i : 1\leq i\leq k, \ \alpha_i + i - 1 \geq k\}|\), so \(d_k(\tilde{\alpha})\) is the number of boxes in the \(k\)-th downward diagonal, from left to right, of the Young diagram of the partition \(\tilde{\alpha}\). Here, the trails of zeros in \(\delta(\tilde{\alpha})\) are omitted. In this article it is shown that \(\mathcal{P}(n)\) is a partially ordered set under majorization: \(\tilde{\alpha}\) majorizes \(\tilde{\beta}\) if \(\sum_{i=1}^k\alpha_i \geq \sum_{i=1}^k\beta_i\) for each legitimate \(k=1,2,3\dots\). Also, it is shown that \(\mathcal{P}(n)\) has unique maximal and minimal elements. Lastly, an explicit formula for the number of partitions with the same diagonal sequence is presented.
This page was built for publication: Diagonal sequences of integer partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6941659)
