A multiset hook length formula and some applications
From MaRDI portal
(Redirected from Publication:409408)
Abstract: A multiset hook length formula for integer partitions is established by using combinatorial manipulation. As special cases, we rederive three hook length formulas, two of them obtained by Nekrasov-Okounkov, the third one by Iqbal, Nazir, Raza and Saleem, who have made use of the cyclic symmetry of the topological vertex. A multiset hook-content formula is also proved.
Recommendations
- Golden tuple products
- Multiple extensions of a finite Euler's pentagonal number theorem and the Lucas formulas
- A combinatorial proof of Jacobi's triple product identity
- Multiple product identities: balanced weights, thetas, finite gold
- scientific article; zbMATH DE number 1304199
- Sums of products of binomial coefficients.
- Hook lengths and 3-cores
- A generalization of the Hirschhorn-Farkas-Kra septagonal numbers identity
- A BIJECTIVE PROOF OF THE QUINTUPLE PRODUCT IDENTITY
- Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition
Cites work
- scientific article; zbMATH DE number 4021231 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 1222942 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 2038300 (Why is no real title available?)
- scientific article; zbMATH DE number 5050088 (Why is no real title available?)
- A Remark by Philip Hall
- Affine root systems and Dedekind's \(\eta\)-function
- An elementary proof of the Macdonald identities for \(A_{\ell}^{(1)}\)
- Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition
- Congruences for Han's generating function
- Cranks and t-cores
- Generalizations of Nekrasov-Okounkov identity
- Lacunarity of certain partition-theoretic generating functions
- Plancherel averages: remarks on a paper by Stanley
- Refined topological vertex, cylindric partitions and \(U(1)\) adjoint theory
- Seiberg-Witten theory and random partitions
- Simple proof of Macdonald's identities for the series A
- Some Conjectures and Open Problems on Partition Hook Lengths
- Some combinatorial properties of hook lengths, contents, and parts of partitions
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- The topological vertex
- Universal characters from the MacDonald identities
Cited in
(7)- Hook lengths and 3-cores
- A Nekrasov-Okounkov type formula for \(\widetilde{C}\)
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- Vertex operators and character varieties
- A Nekrasov-Okounkov formula for Macdonald polynomials
- Modular Nekrasov-Okounkov formulas
- Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition
This page was built for publication: A multiset hook length formula and some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409408)