Asymptotics for generalized integer partitions

We study the asymptotic behavior of weighted partition functions $p_f(n)$, defined by the generating function $\prod_{n \geq 1} (1 - q^{n})^{-f(n)}$ with non-negative real weights $f(n)$. We assume that the associated Dirichlet series $D(s) = \sum_{n \geq 1} f(n) n^{-s}$ admits a meromorphic continuation to a half-plane $\Re(s) \geq -\varepsilon$, with finitely many real poles of arbitrary orders, the largest of which is a positive pole $α$ of order $k$, and a possibly infinite collection of complex poles lying strictly to the left of $α$, with some additional conditions. We extend the saddle-point method of Debruyne and Tenenbaum, and show that the pole $α$ dominates the contribution of all other poles. As a result, we give an explicit asymptotic formula for $p_f(n)$ described via generalized Lambert functions. Furthermore, we show that for $k \geq 2$ no finite combination of powers of $n$, $\log n$, $\log \log n, \ldots$ approximates the saddle point well enough to give an asymptotic formula for $p_f(n)$. We also discuss a number of applications related to algebra, number theory, and combinatorics.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24595
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Asymptotics for generalized integer partitions

Damir Yeliussizov, Armanzhan Onggarbay
arXiv (Cornell University)
Analytic Number Theory Research
preprint

Asymptotics for generalized integer partitions

Damir Yeliussizov, Armanzhan Onggarbay
preprint en

Abstract

We study the asymptotic behavior of weighted partition functions $p_f(n)$, defined by the generating function $\prod_{n \geq 1} (1 - q^{n})^{-f(n)}$ with non-negative real weights $f(n)$. We assume that the associated Dirichlet series $D(s) = \sum_{n \geq 1} f(n) n^{-s}$ admits a meromorphic continuation to a half-plane $\Re(s) \geq -\varepsilon$, with finitely many real poles of arbitrary orders, the largest of which is a positive pole $α$ of order $k$, and a possibly infinite collection of complex poles lying strictly to the left of $α$, with some additional conditions. We extend the saddle-point method of Debruyne and Tenenbaum, and show that the pole $α$ dominates the contribution of all other poles. As a result, we give an explicit asymptotic formula for $p_f(n)$ described via generalized Lambert functions. Furthermore, we show that for $k \geq 2$ no finite combination of powers of $n$, $\log n$, $\log \log n, \ldots$ approximates the saddle point well enough to give an asymptotic formula for $p_f(n)$. We also discuss a number of applications related to algebra, number theory, and combinatorics.

arXiv (Cornell University)
Analytic Number Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon