Polynomial partition asymptotics

Abstract

Let f ∈ Z[y] be a polynomial such that f(N) ⊂eq N, and let pAf(n) denote number of partitions of n whose parts lie in the set Af:=\f(n):n ∈ N\. Under hypotheses on the roots of 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) as n tends to infinity. This generalises asymptotic formulae for the number of partitions into perfect dth powers, established by Vaughan for d=2, and Gafni for the case d ≥ 2, in 2015 and 2016 respectively.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…