Polynomial partition asymptotics

From MaRDI portal




Abstract: Let finmathbbZ[y] be a polynomial such that f(mathbbN)subseteqmathbbN, and let pmathcalAf(n) denote number of partitions of n whose parts lie in the set mathcalAf:=f(n):ninmathbbN. Under hypotheses on the roots of ff(0), we use the Hardy--Littlewood circle method, a polylogarithm identity, and the Matsumoto--Weng zeta function to derive asymptotic formulae for pmathcalAf(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 dgeq2, in 2015 and 2016 respectively.









This page was built for publication: Polynomial partition asymptotics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1684719)