A multiset hook length formula and some applications

被引：3
|
作者：
Dehaye, Paul-Olivier [1 ]
Han, Guo-Niu [2 ,3 ]
机构：
[1] ETH, Dept Math, CH-8092 Zurich, Switzerland
[2] Univ Strasbourg, Inst Rech Math Avancee, F-67084 Strasbourg, France
[3] CNRS, F-67084 Strasbourg, France
来源：
DISCRETE MATHEMATICS | 2011年 / 311卷 / 23-24期
关键词：
Integer partitions; Hook length; q-series; Congruence relations; t-cores; MACDONALD IDENTITIES; TOPOLOGICAL VERTEX; ELEMENTARY PROOF; PARTITIONS;
D O I：
10.1016/j.disc.2011.08.018
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：2690 / 2702
页数：13
相关论文
共 50 条
12345