A central limit theorem for partitions involving generalised divisor functions
Madhuparna Das, Nicolas Robles

TL;DR
This paper proves a central limit theorem for the number of parts in restricted partitions involving the generalized divisor function, extending previous work to a broader class of functions using analytic number theory techniques.
Contribution
It establishes a CLT for partitions with parts weighted by the generalized divisor function, generalizing prior results for power functions and employing Dirichlet series analysis.
Findings
Proves a CLT for the number of summands in partitions involving (n)=(n) for divisor functions.
Analyzes the Dirichlet series (n+1)/n^s for (n)=(n) using Ramanujan sums.
Employs Euler product analysis to support the CLT proof.
Abstract
We define an -restricted partition of fixed length given by the bivariate generating series \begin{align*} Q_f(z,u) \coloneqq 1+\sum_{n=1}^{\infty}\sum_{k=1}^{\infty} p_f(n,k) u^kz^n =\prod_{k=1}^{\infty}(1+uz^k)^{\Delta_f(k)}, \end{align*} where . In this article, we establish a central limit theorem for the number of summands in such partitions when denotes the generalised divisor function, defined as for integer . This can be considered as a generalisation of the work of Lipnik, Madritsch, and Tichy, who previously studied this problem for with . A key element of our proof relies on the analytic behaviour of the Dirichlet series \begin{align*} \sum_{n=1}^{\infty}\frac{\sigma_r(n+1)}{n^s}, \end{align*} for . We study this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Analytic Number Theory Research · Advanced Combinatorial Mathematics
