A multiset hook length formula and some applications

DOI10.1016/J.DISC.2011.08.018zbMATH Open1247.05021arXiv1104.5435OpenAlexW2119806723MaRDI QIDQ409408FDOQ409408

Paul-Olivier Dehaye, Guo-Niu Han

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1104.5435

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

zbMATH Keywords

\(q\)-seriesinteger partitions\(t\)-coreshook lengthcongruence relationsmultiset hook length formula

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The topological vertex
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Refined topological vertex, cylindric partitions and \(U(1)\) adjoint theory
• The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applications
• 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
• Cranks and t-cores
• Combining hook length formulas and BG-ranks for partitions via the Littlewood decomposition
• Some Conjectures and Open Problems on Partition Hook Lengths
• Some combinatorial properties of hook lengths, contents, and parts of partitions
• An elementary proof of the Macdonald identities for \(A_{\ell}^{(1)}\)
• Simple proof of Macdonald's identities for the series A
• A Remark by Philip Hall
• Lacunarity of certain partition-theoretic generating functions
• Title not available (Why is that?)

Cited In (4)

• A Nekrasov-Okounkov type formula for \(\widetilde{C}\)
• Vertex operators and character varieties
• A Nekrasov-Okounkov formula for Macdonald polynomials
• Modular Nekrasov-Okounkov formulas

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)