Exact Limit Theorems for Restricted Integer Partitions

DOI10.1016/J.AIM.2022.108554MaRDI QIDQ6364672arXivWikidataFDO

Authors Asaf Cohen Antonir, Asaf Shapira

Publication date 6 April 2021

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Analytic theory of partitions (11P82)

Abstract: For a set of positive integers $A$, let $p_A(n)$ denote the number of ways to write $n$ as a sum of integers from $A$, and let $p(n)$ denote the usual partition function. In the early 40s, ErdH{o}s extended the classical Hardy--Ramanujan formula for $p(n)$ by showing that $A$ has density $alpha$ if and only if $log{p}_A(n)simlogp(alphan)$. Nathanson asked if ErdH{o}s's theorem holds also with respect to $A$'s lower density, namely, whether $A$ has lower-density $alpha$ if and only if $log{p}_A(n)/logp(alphan)$ has lower limit $1$. We answer this question negatively by constructing, for every $alpha>0$, a set of integers $A$ of lower density $alpha$, satisfying ${\displaystyle }$ liminf_{n ightarrow infty} frac{log p_A(n)}{log p(alpha n)} geq left(frac{sqrt{6}}{pi}-o_{alpha}(1) ight)log(1/alpha);. ${\displaystyle }$ We further show that the above bound is best possible (up to the $o_{a}lpha(1)$ term), thus determining the exact extremal relation between the lower density of a set of integers and the lower limit of its partition function. We also prove an analogous theorem with respect to the upper density of a set of integers, answering another question of Nathanson.

This page was built for publication: Exact Limit Theorems for Restricted Integer Partitions

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