Table of Contents
Fetching ...

Asymptotics of the d'Arcais Numbers at Small $k$

Shannon Starr

TL;DR

This work analyzes the small-$k$ asymptotics of the d'Arcais numbers $A(2,n,k)$ by establishing that $\alpha(n,k)=\frac{k!\,A(2,n,k)}{n!}$ satisfies $\alpha(n,k)\sim\beta(n,k)$ with $\beta(n,k)=\frac{n^{k-1}(\zeta(2))^{k}\sigma_{-2k+1}(n)}{\Gamma(k)\zeta(2k)}$. The authors derive this via circle-method heuristics rooted in the modularity of the Dedekind eta function, then provide a rigorous induction confirming the asymptotics and exploring log-concavity: $\liminf_{n\to\infty}\frac{\alpha(n,k)^2}{\alpha(n,k-1)\alpha(n,k+1)}=0$ for $k=2$, and a strictly positive limit for $k\ge3$. They further show that for $k\ge3$, the liminf exceeds 1, implying asymptotic log-concavity for large $n$, while $k=2$ yields counterexamples. The work connects these numbers to divisor sums and Ramanujan sums, and outlines open problems for higher $\ell$ and remainder-term analyses using modern analytic techniques.

Abstract

The d'Arcais numbers are the triangular array $\{A(2,n,k)\, :\, n=0,1,\dots,\, k=0,\dots,n\}$, such that $\sum_{n=0}^{\infty} \sum_{k=0}^{n} A(2,n,k) x^k z^n/n! = ((z;z)_{\infty})^{-x}$. The infinite $q$-Pochhammer symbol is $(q;q)_{\infty} = \prod_{n=1}^{\infty} (1-q^n)$. Holding $k$ fixed and considering large $n$, we note that the ratio $k! A(2,n,k)/n!$ is asymptotic to $C(k) σ_{2k-1}(n)/n^k$ where the divisor sum function is $σ_p(n) = \sum_{d|n} d^p$ and $C(k) = (ζ(2))^k/(Γ(k) ζ(2k))$. This is a slightly generalized version of one of Ramanujan's formulas from his paper, ``On Certain Arithmetical Functions," and it is an immediate consequence of the more recent article of Oliver, Shreshta and Thorne. Heim and Neuhauser made a conjecture, that $A(2,n,k)/A(2,n,k-1)$ is greater than or equal to $A(2,n,k+1)/A(2,n,k)$, for $k=2,3,\dots$ and all $n$. The conjecture is false for $k=2$, and it is true for $k=3,4,\dots$ when $n$ is sufficiently large. We consider the Hardy-Ramanujan circle method as a heuristic step.

Asymptotics of the d'Arcais Numbers at Small $k$

TL;DR

This work analyzes the small- asymptotics of the d'Arcais numbers by establishing that satisfies with . The authors derive this via circle-method heuristics rooted in the modularity of the Dedekind eta function, then provide a rigorous induction confirming the asymptotics and exploring log-concavity: for , and a strictly positive limit for . They further show that for , the liminf exceeds 1, implying asymptotic log-concavity for large , while yields counterexamples. The work connects these numbers to divisor sums and Ramanujan sums, and outlines open problems for higher and remainder-term analyses using modern analytic techniques.

Abstract

The d'Arcais numbers are the triangular array , such that . The infinite -Pochhammer symbol is . Holding fixed and considering large , we note that the ratio is asymptotic to where the divisor sum function is and . This is a slightly generalized version of one of Ramanujan's formulas from his paper, ``On Certain Arithmetical Functions," and it is an immediate consequence of the more recent article of Oliver, Shreshta and Thorne. Heim and Neuhauser made a conjecture, that is greater than or equal to , for and all . The conjecture is false for , and it is true for when is sufficiently large. We consider the Hardy-Ramanujan circle method as a heuristic step.
Paper Structure (8 sections, 5 theorems, 82 equations, 1 figure)

This paper contains 8 sections, 5 theorems, 82 equations, 1 figure.

Key Result

Theorem 2.1

For $a,b\geq 0$ and $r,s\geq 1$, we have

Figures (1)

  • Figure 1: Here we plot two similar figures. On the left we have $\ln\left(|F(t-i\theta)|^2/(F(t))^2\right)$ for $t=1/50,000$, calculated by including $250,000$ terms in the $n$-sum for the power series of $F$. The colors represent $\cos(\phi)$ when we write $F(t-i\theta)/F(t) = \rho e^{i\phi}$. The dots are placed whenever $\cos(\phi)>0.99$. On the right hand side, we have plotted $-4\ln(q)$ versus $p/q$ for the the Farey sequence with denominators up to 250, for comparison.

Theorems & Definitions (7)

  • Theorem 2.1
  • Corollary 2.2
  • Remark 2.3
  • Corollary 2.4
  • Remark 2.5
  • Lemma 4.1
  • Lemma 4.2