New hook-content formulas for strict partitions
The hook-length statistic is an important tool in the study of partitions, algebraic combinatorics, and representation theory. In the paper under review, the authors introduce a difference operator for functions defined on strict partitions, i.e. partitions \((\lambda_1,\lambda_2,\ldots,\lambda_{\ell})\) with \(\lambda_i>\lambda_{i+1}\) for all \(i=1,\ldots,\ell-1\). This difference operator is an analog of the difference operator for ordinary partitions introduced by the authors in [``Difference operators for partitions and some applications, Preprint, \url{arXiv:1508.00772}] and is used to derive several new hook-content formulas for strict partitions as well as a polynomial property for a summation involving the hook length and the content statistics.
- New hook-content formulas for strict partitions
- Difference operators for partitions and some applications
- Generalized hook and content numbers identities---the projective case
- Some combinatorial properties of hook lengths, contents, and parts of partitions
- Polynomiality of Plancherel averages of hook-content summations for strict, doubled distinct and self-conjugate partitions
- A combinatorial problem
- An elementary proof of the hook formula
- Anisotropic Young Diagrams and Infinite-Dimensional Diffusion Processes with the Jack Parameter
- Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition
- Difference operators for partitions under the Littlewood decomposition
- Hook lengths and shifted parts of partitions
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- On the foundations of combinatorial theory I. Theory of M�bius Functions
- Plancherel averages: remarks on a paper by Stanley
- Polynomiality of Plancherel averages of hook-content summations for strict, doubled distinct and self-conjugate partitions
- Polynomiality of some hook-length statistics
- Seiberg-Witten theory and random partitions
- Some combinatorial properties of hook lengths, contents, and parts of partitions
- Some Conjectures and Open Problems on Partition Hook Lengths
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- Generalized hook and content numbers identities---the projective case
- Difference operators for partitions and some applications
- Difference operators for partitions under the Littlewood decomposition
- Polynomiality of certain average weights for oscillating tableaux
- Polynomiality of Plancherel averages of hook-content summations for strict, doubled distinct and self-conjugate partitions
- New hook-content formulas for strict partitions
- Hook length biases and general linear partition inequalities
- Hook length biases in ordinary and \(t\)-regular partitions
- Hook length inequalities for t-regular partitions in the t-aspect
- Hook length inequalities for t-regular partitions in the t-aspects. II
- Hook length bias in odd versus distinct partitions
This page was built for publication: New hook-content formulas for strict partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2358797)
