相关论文: On conjectures regarding the Nekrasov--Okounkov ho…

Recently, the first author generalized a formula of Nekrasov and Okounkov which gives a combinatorial formula, in terms of hook lengths of partitions, for the coefficients of certain power series. In the course of this investigation, he…

The paper is devoted to the derivation of the expansion formula for the powers of the Euler Product in terms of partition hook lengths, discovered by Nekrasov and Okounkov in their study of the Seiberg-Witten Theory. We provide a refinement…

In 2009, the first author proved the Nekrasov-Okounkov formula on hook lengths for integer partitions by using an identity of Macdonald in the framework of type $\widetilde A$ affine root systems, and conjectured that some summations over…

We prove a Macdonald polynomial analogue of the celebrated Nekrasov-Okounkov hook-length formula from the theory of random partitions. As an application we obtain a proof of one of the main conjectures of Hausel and Rodriguez-Villegas from…

In 2008, Han rediscovered an expansion of powers of Dedekind $\eta$ function attributed to Nekrasov and Okounkov (which was actually first proved the same year by Westbury) by using a famous identity of Macdonald in the framework of type…

The symplectic/orthogonal contents of partitions are related to the dimensions of irreducible representations of symplectic/orthogonal groups. In 2012, motivated by Nekrasov--Okounkov's hook-length formula and Stanley's hook-content…

This paper proves a generalization of a conjecture of Guoniu Han, inspired originally by an identity of Nekrasov and Okounkov. The main result states that certain sums over partitions p of n, involving symmetric functions of the squares of…

In 2008, Han rediscovered an expansion of powers of Dedekind $\eta$ function due to Nekrasov and Okounkov by using Macdonald's identity in type $\widetilde{A}$. In this paper, we obtain new combinatorial expansions of powers of $\eta$, in…

Motivated by the Nekrasov-Okounkov formula on hook lengths, the first author conjectured that the Plancherel average of the $2k$-th power sum of hook lengths of partitions with size $n$ is always a polynomial of $n$ for any $k\in…

Motivated in part by hook-content formulas for certain restricted partitions in representation theory, we consider the total number of hooks of fixed length in odd versus distinct partitions. We show that there are more hooks of length $2$,…

We prove a conjecture of Okada giving an exact formula for a certain statistic for hook-lengths of partitions: \frac{1}{n!} \sum_{\lambda \vdash n} f_{\lambda}^2 \sum_{u \in \lambda} \prod_{i=1}^{r}(h_u^2 - i^2) = \frac{1}{2(r+1)^2}…

The dimension of an irreducible representation of $GL(n,\mathbb{C})$, $Sp(2n)$, or $SO(n)$ is given by the respective hook-length and content formulas for the corresponding partition. The first author, inspired by the Nekrasov-Okounkov…

The Nekrasov-Okounkov formula gives an expression for the Fourier coefficients of the Euler functions as a sum of hook length products. This formula can be deduced from a specialization in a renormalization of the affine type $A$ Weyl…

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,…

We establish a hook length bias between self-conjugate partitions and partitions of distinct odd parts, demonstrating that there are more hooks of fixed length $t \geq 2$ among self-conjugate partitions of $n$ than among partitions of…

We attach to normalized (non-vanishing) arithmetic functions $g$ and $h$ recursively defined polynomials. Let $P_0^{g,h}(x):=1$. Then \begin{equation} P_n^{g,h}(x) := \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{equation}…

Nekrasov-Okounkov identity gives a product representation of the sum over partitions of a certain function of partition hook length. In this paper we give several generalizations of the Nekrasov-Okounkov identity using the cyclic symmetry…

We give relations between the joint distributions of multiple hook lengths and of frequencies and part sizes in partitions, extending prior work in this area. These results are discovered by investigating truncations of the…

We prove a conjecture by Diaz-Lopez et al. that bounds the roots of descent polynomials. To do so, we prove an algebraic inequality, which we refer to as the "Slice and Push Inequality." This inequality compares expressions that come from…

This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th…