Papers
Topics
Authors
Recent
Search
2000 character limit reached

Nekrasov–Okounkov Polynomials

Updated 23 January 2026
  • Nekrasov–Okounkov polynomials are defined via generating functions using partition hook-lengths, encoding Fourier coefficients of the Dedekind eta function.
  • They exhibit notable algebraic structures and recurrences, with properties such as coefficient unimodality, log-concavity, and Hurwitz stability under certain conditions.
  • These polynomials bridge diverse areas including modular forms, representation theory, and mathematical physics, with applications in instanton moduli and vertex operator algebras.

Nekrasov–Okounkov polynomials constitute a fundamental family of polynomials naturally arising at the interface of combinatorics, representation theory, mathematical physics, and algebraic geometry. Originally introduced to encapsulate partition statistics via hook-lengths and to encode the Fourier coefficients of powers of the Dedekind eta function, these polynomials possess deep connections to modular forms, random partitions, moduli spaces of instantons, and the structural theory of symmetric functions.

1. Definition, Generating Function, and Hook-Length Formula

Let λ\lambda be a partition of nn with Young diagram. Define for each cell uu:

  • Arm au(λ)a_u(\lambda): number of boxes to the right in the row of uu
  • Leg u(λ)\ell_u(\lambda): number of boxes below in the column of uu
  • Hook-length hu(λ)=au(λ)+u(λ)+1h_u(\lambda) = a_u(\lambda) + \ell_u(\lambda) + 1

Denoting the multiset of hook-lengths as H(λ)\mathcal{H}(\lambda), the Nekrasov–Okounkov polynomials Pn(z)P_n(z) (or, after translation in zz, Qn(z)Q_n(z)) are defined by the generating function

n=0Pn(z)qn=m=1(1qm)z\sum_{n=0}^\infty P_n(z)\,q^n = \prod_{m=1}^\infty (1-q^m)^{-z}

with the explicit hook-formula

Qn(z)=λ=nhH(λ)(1+zh2)Q_n(z) = \sum_{|\lambda|=n} \prod_{h \in \mathcal{H}(\lambda)} \left(1 + \frac{z}{h^2}\right)

or, equivalently, Qn(z)=Pn(z+1)Q_n(z) = P_n(z+1) (Heim et al., 2018, Heim et al., 2020). These polynomials have degree nn and positive coefficients.

2. Recurrences and Algebraic Structure

Nekrasov–Okounkov polynomials arise as a specialization of the two-parameter family Png,h(x)P_n^{g,h}(x) defined recursively: P0g,h(x)=1,Png,h(x)=xh(n)k=1ng(k)Pnkg,h(x)P_0^{g,h}(x) = 1,\qquad P_n^{g,h}(x) = \frac{x}{h(n)} \sum_{k=1}^n g(k)\,P_{n-k}^{g,h}(x) with

g(n)=σ(n)=dnd,h(n)=ng(n) = \sigma(n) = \sum_{d|n} d,\quad h(n) = n

for the Nekrasov–Okounkov/D'Arcais case (Heim et al., 2020, Heim et al., 2022, Heim et al., 2021). The underlying generating function is

m=1(1qm)x=n=0Pnσ,id(x)qn\prod_{m=1}^\infty (1-q^m)^{-x} = \sum_{n=0}^\infty P_n^{\sigma,\mathrm{id}}(x)\,q^n

and the explicit expression for the polynomial coefficients is

Aσ,id(n,m)=n!m!k1++km=ni=1mσ(ki)A_{\sigma,\mathrm{id}}(n,m) = \frac{n!}{m!} \sum_{k_1 + \dots + k_m = n} \prod_{i=1}^m \sigma(k_i)

The D’Arcais (sometimes: “Serre–Newman”) polynomials correspond to Pnσ,id(z)P_n^{\sigma,\mathrm{id}}(z), and Qn(z)=Pn(z+1)Q_n(z) = P_n(z+1).

3. Properties: Roots, Unimodality, and Log-Concavity

The polynomials Qn(z)Q_n(z) satisfy several notable analytic and combinatorial properties:

  • Zeros: Amdeberhan conjectured all roots are real, simple, and negative; Heim–Neuhauser disproved total realness for n=10n=10 and higher (Heim et al., 2018). Numerical evidence up to n=700n=700 supports the refined conjecture: all zeros are simple, and all nonreal zeros lie in the open left-half plane Rez<0\operatorname{Re} z < 0 (i.e., Hurwitz stability) (Heim et al., 2023).
  • Coefficient Unimodality and Log-Concavity: The coefficients (An,0,...,An,n)(A_{n,0}, ..., A_{n,n}) of Qn(z)Q_n(z) are conjectured and numerically verified to be unimodal and ultra-log-concave for n1500n \leq 1500 (Hong et al., 2020, Heim et al., 2020, Heim et al., 2018). Hong–Zhang prove that this holds for small kk (kn1/6/lognk \ll n^{1/6}/\log n), and that the tail is monotonically decreasing for large kk (knlognk \gg \sqrt{n} \log n), reducing the full unimodality conjecture to explicit log-concavity conditions on auxiliary sequences. This property connects to the Pólya frequency sequence criterion and real-rootedness of generating polynomials.
  • Recurrence Structure: While Png,h(x)P_n^{g,h}(x) can yield orthogonal polynomial systems for certain pairs (g,h)(g,h), in the Nekrasov–Okounkov case (g=σg=\sigma, h(n)=nh(n)=n) one does not obtain a three-term recurrence nor classical orthogonality (Heim et al., 2022, Heim et al., 2021).

4. Connections to Partition Theory, Modular Forms, and Representation Theory

Nekrasov–Okounkov polynomials provide a bridge between partition enumeration, modular objects, and algebraic combinatorics:

  • Modular Context: The nn-th coefficient of m=1(1qm)r\prod_{m=1}^\infty (1-q^m)^{r} equals Pnσ,id(r)P_n^{\sigma,\mathrm{id}}(r); the vanishing of such coefficients is tightly linked to Lehmer’s conjecture on Ramanujan’s τ\tau–function (Heim et al., 2021, Heim et al., 2023).
  • Generalizations and Analogues: The polynomials interpolate between classical families: for g(n)=ng(n) = n, h(n)=nh(n) = n they recover associated Laguerre polynomials; for g(n)=ng(n) = n, h(n)=1h(n) = 1, the Chebyshev polynomials of the second kind (Heim et al., 2022, Heim et al., 2023). Variations involving different g,hg, h correspond to distinct root and orthogonality structures.
  • Refinements and Modular Extensions: Modular generalizations, involving restriction to rr-cores or summing only over hooks divisible by rr, yield further polynomial families with applications to the generating functions of moduli spaces and affine root systems (Walsh et al., 2019, Wahiche, 2023), often realized as “type C~\widetilde C” or “doubled-distinct/self-conjugate” partition enumerations (Han et al., 2016, Pétréolle, 2015).
  • Representation Theory and Instanton Moduli: Generalized Jack and Macdonald polynomials—crucial in the study of instanton moduli spaces—reduce in special cases to expressions involving Nekrasov–Okounkov polynomials and their hook-length factorizations. This connection is encoded in the AGT correspondence and in formulas for equivariant localization (Smirnov, 2014, Rains et al., 2016).

5. Deformations, Wreath Products, and Cluster Extensions

Recent developments generalize the classical Nekrasov–Okounkov formula to higher rank and modular settings:

  • (q,t)(q,t) and Wreath Deformations: The (q,t)(q,t)–Nekrasov–Okounkov formula for Macdonald polynomials (Rains–Warnaar) replaces hook ratios with (q,t)(q,t)–ratios, yielding a four–parameter plethystic product and settling conjectures on Hodge polynomials of character varieties (Rains et al., 2016). The extension to the wreath-Macdonald case (r3r\geq 3), involving rr-core and rr-quotient decompositions and “mixed” hook-lengths, has been proved via Ext operator formalism (Ferlinc et al., 14 Aug 2025).
  • Multi-Parameter and Topological Vertex Extensions: New “Nekrasov–Okounkov type” formulas, depending on $2N+1$ parameters, arise from the symmetries of the topological vertex and rotation invariance, supporting NN-tuples of partitions and manifesting as sum-product identities relevant in refined topological string theory and vertex operator algebra (Yang, 2023).
  • Macdonald Identities for Affine Types: Uniform qq–Nekrasov–Okounkov formulas exist for all seven families of affine root systems (types A~,B~,C~\widetilde{A}, \widetilde{B}, \widetilde{C} etc.), with explicit combinatorial interpretation via abacus models and content statistics, further emphasizing the central role of these polynomials in the theory of symmetric functions, cores, and Schur-type enumerations (Wahiche, 2023).

6. Specializations, Polynomiality, and Applications

Several structural phenomena are notable:

  • Polynomiality of Weighted Hook Sums: For classical, “doubled-distinct,” and “self-conjugate” partition classes, sums over partitions of products of symmetric functions in hooks and contents, normalized by hook-products (e.g., F1F2Ht(λ)\sum \frac{F_1\cdot F_2}{H_t(\lambda)}), are always polynomials in the level parameter nn; closed forms and degree bounds follow combinatorially via difference operators on tt-quotients and Littlewood decomposition, generalizing Stanley’s seminal result for all partitions (Han et al., 2016).
  • Physical and Enumerative Applications: The connection to random partitions, Seiberg–Witten theory, and the geometry of Hilbert schemes links Nekrasov–Okounkov polynomials to counting problems in gauge theory, crystal melting, and quantum invariants (Heim et al., 2018, Pétréolle, 2015, Smirnov, 2014).
  • Explicit Coefficient Identities and Asymptotics: Explicit closed forms for coefficients and growth bounds of Pn(z)P_n(z) have been established, including best-known non-vanishing regions for eta powers and strong control on the zero distributions (Heim et al., 2021, Heim et al., 2023).

7. Open Questions and Future Directions

Active areas of investigation include:

  • Complete Unimodality and Log-Concavity: The transition regime where unimodality remains undetermined invites refined asymptotic and combinatorial bounds, possibly via deeper analysis of convolution recursions and partition asymptotics (Hong et al., 2020, Heim et al., 2020).
  • Full (q,t)(q,t) and Elliptic Generalizations: Modular and elliptic analogues (involving theta functions in place of (1qa)(1-q^a) factors; see the Walsh–Warnaar and related conjectures) are open and subject to computation and proof via operator traces, Plethystic identities, and geometric representation theory (Ferlinc et al., 14 Aug 2025, Walsh et al., 2019).
  • Algebraic and Geometric Proofs: Bijective, representation-theoretic, and geometric arguments for identities previously obtained analytically, especially for wreath-product and affine-type generalizations, are sought. There is particular interest in combinatorial models for Ext-operator actions and modular parameter dependence (Ferlinc et al., 14 Aug 2025, Yang, 2023).
  • Interdisciplinary Links: Potential applications extend to the theory of special functions, random matrix ensembles, cluster algebras, and integrable systems.

Summary Table: Core Characteristics

Aspect Classical NO Polynomials Generalizations
Recurrence Pn(z)=znk=1nσ(k)Pnk(z)P_n(z) = \frac{z}{n}\sum_{k=1}^n \sigma(k) P_{n-k}(z) Modular restrictions, (q,t)(q,t), rr-core variants
Generating Function m=1(1qm)z\prod_{m=1}^\infty (1-q^m)^{-z} Products over cores, qq-Pochhammer, topological vertex
Partition Classes All partitions Doubled-distinct, self-conjugate, tt-cores
Root Properties Simple, Hurwitz-stable (conjectural) Analogous, with nonreal zeros in left-half plane
Orthogonality No classical OPS, no 3-term recurrence (g(n)=n,h(n)=ns)(g(n)=n, h(n)=n^s): Laguerre/Chebyshev special cases
Physics/Geom. Connection Eta-function powers, gauge theory Hilbert schemes, instanton moduli, AGT correspondence
Open Problems Unimodality, full root location, elliptic generalization Bijective proofs, modular parametrization

For further technical details, proof sketches, and extensive references, see (Heim et al., 2018, Heim et al., 2020, Rains et al., 2016, Walsh et al., 2019, Pétréolle, 2015, Heim et al., 2023, Smirnov, 2014, Ferlinc et al., 14 Aug 2025, Yang, 2023, Wahiche, 2023, Heim et al., 2020, Heim et al., 2021, Heim et al., 2022, Hong et al., 2020), and (Han et al., 2016).

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Nekrasov--Okounkov Polynomials.