A multiset hook length formula and some applications
classification
🧮 math.CO
keywords
formulahooklengthmultisetapplicationscasescombinatorialcyclic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.