English

Polynomial partition asymptotics

Number Theory 2018-04-20 v7

Abstract

Let fZ[y]f \in \mathbb{Z}[y] be a polynomial such that f(N)Nf(\mathbb{N}) \subseteq \mathbb{N}, and let pAf(n)p_{\mathcal{A}_{f}}(n) denote number of partitions of nn whose parts lie in the set Af:={f(n):nN}\mathcal{A}_f:=\{f(n):n \in \mathbb{N}\}. Under hypotheses on the roots of ff(0)f-f(0), we use the Hardy--Littlewood circle method, a polylogarithm identity, and the Matsumoto--Weng zeta function to derive asymptotic formulae for pAf(n)p_{\mathcal{A}_f}(n) as nn tends to infinity. This generalises asymptotic formulae for the number of partitions into perfect ddth powers, established by Vaughan for d=2d=2, and Gafni for the case d2d \geq 2, in 2015 and 2016 respectively.

Keywords

Cite

@article{arxiv.1705.00384,
  title  = {Polynomial partition asymptotics},
  author = {Alexander Dunn and Nicolas Robles},
  journal= {arXiv preprint arXiv:1705.00384},
  year   = {2018}
}

Comments

26 pages, Improved exposition throughout and several typos fixed

R2 v1 2026-06-22T19:32:25.180Z