A multiset hook length formula and some applications
From MaRDI portal
Publication:409408
DOI10.1016/j.disc.2011.08.018zbMath1247.05021arXiv1104.5435MaRDI QIDQ409408
Paul-Olivier Dehaye, Guo-Niu Han
Publication date: 13 April 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.5435
\(q\)-series; integer partitions; congruence relations; \(t\)-cores; hook length; multiset hook length formula
05A17: Combinatorial aspects of partitions of integers
Related Items
A Nekrasov-Okounkov type formula for \(\widetilde{C}\), Vertex operators and character varieties, A Nekrasov-Okounkov formula for Macdonald polynomials, Modular Nekrasov-Okounkov formulas
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some combinatorial properties of hook lengths, contents, and parts of partitions
- Refined topological vertex, cylindric partitions and \(U(1)\) adjoint theory
- The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
- An elementary proof of the Macdonald identities for \(A_{\ell}^{(1)}\)
- Simple proof of Macdonald's identities for the series A
- Generalizations of Nekrasov-Okounkov identity
- Plancherel averages: remarks on a paper by Stanley
- Congruences for Han's generating function
- Universal characters from the MacDonald identities
- Affine root systems and Dedekind's \(\eta\)-function
- The topological vertex
- Cranks and t-cores
- Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition
- A Remark by Philip Hall
- Lacunarity of certain partition-theoretic generating functions
- Some Conjectures and Open Problems on Partition Hook Lengths