Papers
Topics
Authors
Recent
Search
2000 character limit reached

D’Arcais Polynomials and Their Applications

Updated 23 January 2026
  • D’Arcais polynomials are a family of degree‑n polynomials defined via a q‑series expansion of Euler’s infinite product that encodes partition hook‑lengths.
  • They satisfy a hereditary recurrence relation and exhibit striking properties such as log‑concavity, unimodality, and Hurwitz stability of nonzero roots.
  • Specializations of these polynomials recover classical functions like the partition function, Ramanujan’s tau function, and k‑colored partition counts, bridging combinatorics and arithmetic.

D’Arcais polynomials—also called Nekrasov–Okounkov polynomials—form a central family of degree-nn polynomials Pn(z)P_n(z) in one variable zz, arising as the qnq^n-coefficients in the z-zth power of Euler’s infinite product, m=1(1qm)z\prod_{m=1}^\infty (1-q^m)^{-z}. These polynomials connect a wide array of mathematical subfields: they encode the combinatorics of partition hook-lengths, dictate the coefficients of Dedekind η\eta-function powers, appear in modular forms and number-theoretic contexts, and give rise to rich algebraic and analytic phenomena via their roots, recursions, and specializations.

1. Definition, Recurrences, and Generating Functions

The D’Arcais polynomials 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}

for q<1|q|<1 and zCz\in\mathbb{C} (Heim et al., 2020, Starr, 12 Jan 2026).

Equivalently,

n=0Pn(z)qn=exp(zm=1σ1(m)qmm),\sum_{n=0}^\infty P_n(z)\,q^n = \exp\left(z \sum_{m=1}^\infty \sigma_1(m)\frac{q^m}{m}\right),

where σ1(m)=dmd\sigma_1(m) = \sum_{d\mid m} d is the divisor sum function (Heim et al., 2023).

The polynomials satisfy a hereditary-type recurrence: Pn(z)=znk=1nσ1(k)Pnk(z),P0(z)=1.P_n(z) = \frac{z}{n}\sum_{k=1}^{n} \sigma_1(k)\,P_{n-k}(z),\quad P_0(z)=1. This recurrence is linear with nonconstant coefficients, in contrast to classical convolution recursions. The combinatorial interpretation is encoded by the following hook-length (partition sum) formula: Pn(z)=λnhHook(λ)(1+zh2),P_n(z) = \sum_{\lambda\vdash n} \prod_{h\in \mathrm{Hook}(\lambda)}\left(1+\frac{z}{h^2}\right), where the sum runs over integer partitions λ\lambda of nn, and Hook(λ)\mathrm{Hook}(\lambda) denotes the hook-length multiset of λ\lambda (Heim et al., 2020, Heim et al., 2018). The shifted form gives a direct connection to the Nekrasov–Okounkov hook-length formula and arises in the context of Seiberg–Witten theory and random partitions.

For more generality, one considers the two-variable polynomials Png,h(x)P_n^{g,h}(x) attached to normalized arithmetic functions g()g(\cdot), h()h(\cdot) via

Png,h(x)=xh(n)k=1ng(k)Pnkg,h(x),P0g,h(x)=1,P_n^{g,h}(x) = \frac{x}{h(n)}\sum_{k=1}^{n} g(k)\,P_{n-k}^{g,h}(x),\quad P_0^{g,h}(x)=1,

with the D’Arcais case realized by g(n)=σ1(n)g(n)=\sigma_1(n) and h(n)=nh(n)=n (Heim et al., 2020, Heim et al., 2020).

2. Coefficients, Partition Sums, and Special Values

The coefficients A(n,m)A(n,m) of Pn(z)=m=0nA(n,m)zmP_n(z) = \sum_{m=0}^{n} A(n,m)z^m admit explicit partition-sum descriptions: A(n,m)=λ(nm)i=1(λ)σ1(λi+1)k=0λ+(λ)1(nk)i=1(λ)(λi+1),A(n,m) = \sum_{\lambda\vdash(n-m)}\prod_{i=1}^{\ell(\lambda)}\sigma_1(\lambda_i+1) \cdot \frac{\prod_{k=0}^{|\lambda|+\ell(\lambda)-1}(n-k)}{\prod_{i=1}^{\ell(\lambda)}(\lambda_i+1)}, where λ\lambda ranges over partitions of nmn-m, (λ)\ell(\lambda) is the length, and λ|\lambda| the sum of the parts (Heim et al., 2020, Heim et al., 2020).

Key specializations include:

  • Pn(1)=p(n)P_n(1) = p(n), the partition function.
  • Pn(1)P_n(-1) (up to sign), the number of partitions into distinct parts.
  • Pn(24)=τ(n)P_n(-24) = \tau(n), Ramanujan’s tau function (Barbero et al., 2020).
  • Pn(k)=pk(n)P_n(k) = p_k(n), the number of kk-colored partitions (Neuhauser, 16 Jan 2026).

These evaluations link the polynomials to classical modular forms, with η(τ)z\eta(\tau)^{-z}'s Fourier coefficients identified as Pn(z)P_n(z) (up to a qq-exponential shift) (Heim et al., 2020). Further, E4(τ)1E_4(\tau)^{-1} and E6(τ)1E_6(\tau)^{-1} reciprocals give Pn(240)P_n(-240) and Pn(504)P_n(504), respectively.

3. Root and Zero-Locus Properties

The location and nature of the zeros of D’Arcais polynomials have been central to several conjectures and results:

  • Original conjectures due to Amdeberhan posited simplicity and real-negativity of roots, with reality first failing at n=10n=10, where a pair of complex-conjugate roots appears (Heim et al., 2018).
  • The revised conjecture, broadly supported numerically, posits that all nontrivial roots lie in the open left half-plane, i.e., every root 0\neq0 satisfies Re(z)<0\mathrm{Re}(z)<0; such polynomials are Hurwitz-stable (Heim et al., 2018).
  • The smallest real root of the auxiliary Volterra sequence QngQ_n^g and its scaling relationship to the real zeros of Png,hP_n^{g,h} gives fine control of zero locations. Transfer lemmas relate zeros via yxH(n1)y \approx x H(n-1), asymptotically capturing the lower and upper tail behavior (Heim et al., 2023).
  • For the Chebyshev/Laguerre model, new explicit enclosing intervals for zeros of Lm(1)L_m^{(1)} and HnH_n have been obtained. For physicists’ Hermite polynomials Hn(x)H_n(x), the real zeros satisfy xcos(π/(n+1))2n2|x| \le \cos(\pi/(n+1))\sqrt{2n-2} (Heim et al., 2023).
  • Roots of Pnσ(z)P_n^\sigma(z) are excluded from broad families of cosets and algebraic numbers by algebraic-number-theoretic methods (Dedekind–Kummer theorem). For every m3m\ge3, all n1n\ge1, Pnσ(ζm)0P_n^\sigma(\zeta_m)\neq0 for ζm\zeta_m any primitive mmth root of unity, with further exclusions in cyclotomic and quadratic fields (Heim et al., 20 Nov 2025, Heim et al., 7 Sep 2025).

4. Log-concavity, Unimodality, and Array Properties

D’Arcais polynomials and their coefficients display strong log-concavity and unimodality properties:

  • The sequence of coefficients in Pn(z)P_n(z) is ultra-log-concave for all 1n10001\leq n\leq1000 (checked explicitly), which in turn forces unimodality (Heim et al., 2018).
  • Horizontal log-concavity (fixed nn, varying mm) is supported up to n=1500n=1500; vertical log-concavity (fixed mm, varying nn) generally fails globally but a weaker vertical CC-log-concavity (up to nCmn\leq C m) is expected (Heim et al., 2020).
  • These log-concavity results are connected to Newton’s inequalities and the root distribution, and undergird monotonicity results such as strict decrease of p(n)n\sqrt[n]{p(n)} for n6n\geq6 (Sun’s conjecture and generalizations) (Neuhauser, 16 Jan 2026).

5. Applications in Partition Theory, Modular Forms, and Asymptotics

D’Arcais polynomials underpin a range of arithmetic and combinatorial results:

  • Modular lacunarity: Serre used values Pn(r)P_n(r) to determine exactly which even rr yield lacunary powers η(τ)r\eta(\tau)^{-r} (Heim et al., 2020).
  • Lehmer’s conjecture, which states all non-trivial Fourier coefficients of η(τ)24\eta(\tau)^{24} are non-zero, is equivalent to Pn(24)0P_n(-24)\neq0 for all nn (Heim et al., 20 Nov 2025, Heim et al., 7 Sep 2025).
  • Sun’s conjecture on partition root monotonicity is reframed as a property of the largest real zero of certain D’Arcais polynomials, extending to kk-colored, plane, and overpartitions (Neuhauser, 16 Jan 2026).
  • Connections to orthogonal polynomials: for prescribed arithmetic functions gg and hh, the family Png,hP_n^{g,h} includes as special cases the Chebyshev, associated Laguerre, Pochhammer, and, via partitions, MacMahon’s plane partition polynomials (Heim et al., 2020, Heim et al., 2023).
  • Probabilistic large deviations: The coefficients A(2,n,k)A(2,n,k), when normalized, satisfy Bahadur–Rao type large deviation asymptotics for k/nκ[0,1)k/n\to\kappa\in[0,1), governed by a Legendre–Fenchel transform determined by the abundancy index sequence an=σ(n)/na_n=\sigma(n)/n. This forms a bridge between the arithmetic of the divisor function and the probabilistic structure of weighted set partitions and commuting permutations (Starr, 12 Jan 2026).

6. Algebraic and Analytic Techniques for Non-vanishing and Zero-Detection

The zero-detection and non-vanishing theory for D’Arcais polynomials leverages deep algebraic number theory:

  • Recurrences for the normalized polynomials Ang(X)A_n^g(X) modulo small primes, especially p=2,3p=2,3, show total splitting into linear factors, a key to proving non-vanishing on entire cosets in cyclotomic rings (Heim et al., 7 Sep 2025).
  • Dedekind–Kummer theorem is used to connect the minimal polynomial of an algebraic integer α\alpha to the possible vanishing of Png(α)P_n^g(\alpha). Inert or ramified primes rule out vanishing by ensuring irreducibility mod pp (Heim et al., 20 Nov 2025).
  • For the D’Arcais case (g=σg=\sigma), explicit arithmetic congruence conditions exclude vanishing at roots of unity and their translates, as well as most elements in Gaussian and quadratic integer rings—leaving potential roots extremely sparse (Heim et al., 20 Nov 2025, Heim et al., 7 Sep 2025).

7. Open Problems and Future Directions

Current avenues of research focus on:

  • Establishing full horizontal log-concavity for all D’Arcais polynomials (Heim et al., 2020).
  • Determining the optimal constant CC for vertical CC-log-concavity (Hong–Zhang) (Heim et al., 2020).
  • Complete characterization of root locations, especially the Hurwitz stability conjecture for Hnσ(X)=Pnσ(X)/XH_n^\sigma(X)=P_n^\sigma(X)/X (Heim et al., 20 Nov 2025).
  • Extending large-deviation and partition asymptotic analysis to related polynomial families and interpreting zero-locus phenomena for general (g,h)(g,h) frameworks (Starr, 12 Jan 2026, Neuhauser, 16 Jan 2026).
  • Advancing toward a proof of the Lehmer conjecture for all nn (Pnσ(24)0P_n^\sigma(-24)\ne0) by further refining arithmetic exclusion arguments (Heim et al., 20 Nov 2025, Heim et al., 7 Sep 2025).

D’Arcais polynomials thus constitute a nexus of partition combinatorics, modular form theory, algebraic number theory, and enumerative probabilistic asymptotics, with their properties continuing to fuel major developments across these disciplines.

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 D'Arcais Polynomials.