Related papers: A Nekrasov-Okounkov formula for Macdonald polynomi…
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…
The Nekrasov--Okounkov hook length formula provides a fundamental link between the theory of partitions and the coefficients of powers of the Dedekind eta function. In this paper we examine three conjectures presented by Amdeberhan. The…
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…
Using Littlewood's map, which decomposes a partition into its $r$-core and $r$-quotient, Han and Ji have shown that many well-known hook-length formulas admit modular analogues. In this paper we present a variant of the Han-Ji…
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}…
A well-known representation-theoretic model for the transformed Macdonald polynomial $\widetilde{H}_\mu(Z;t,q)$, where $\mu$ is an integer partition, is given by the Garsia-Haiman module $\mathcal{H}_\mu$. We study the $\frac{n!}{k}$…
A multivariable hypergeometric-type formula for raising operators of the Macdonald polynomials is conjectured. It is proved that this agrees with Jing and Jozefiak's expression for the two-row Macdonald polynomials, and also with Lassalle…
We present formulas of Rodrigues type giving the Macdonald polynomials for arbitrary partitions through the repeated application of creation operators on the constant 1. Three expressions for the creation operators are derived one from the…
We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-$t$-Macdonald polynomials of two rows.
Using our earlier results on polynomiality properties of plethystic logarithms of generating series of certain type we show that Schiffmann's formulas for various counts of Higgs bundles over finite fields can be reduced to much simpler…
A string theoretic derivation is given for the conjecture of Hausel, Letellier, and Rodriguez-Villegas on the cohomology of character varieties with marked points. Their formula is identified with a refined BPS expansion in the stable pair…
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,…
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…
We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the…
Inhomogeneous analogues of symmetric and nonsymmetric Macdonald polynomials were introduced by F. Knop and the author. In the symmetric case A. Okounkov has recently proved a beautiful expansion formula which can be viewed as a…
We introduce a wreath Macdonald polynomial analogue of the Carlsson--Nekrasov--Okounkov vertex operator. As an application, we prove a modular $(q,t)$-Nekrasov--Okounkov formula for $r\ge 3$ originally conjectured by Walsh and Warnaar.
The two-parameter Macdonald polynomials are a central object of algebraic combinatorics and representation theory. We give a Markov chain on partitions of k with eigenfunctions the coefficients of the Macdonald polynomials when expanded in…
We give an explicit solution of the ADHM recursion formula conjectured by Chuang, Diaconescu, and Pan. This solution is closely related to the formula for the Hodge polynomials of Higgs moduli spaces conjectured by Hausel and…
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…