Log-Concavity of the Partition Function
Stephen DeSalvo, Igor Pak

TL;DR
This paper proves the log-concavity of the partition function p(n) for all n > 25 and extends these results to address related conjectures, using advanced estimates of series remainders.
Contribution
It establishes the log-concavity of p(n) beyond n=25 and resolves two conjectures by Chen through novel analytical techniques.
Findings
p(n) is log-concave for all n > 25
Extended results to two related conjectures by Chen
Used Lehmer's estimates on Hardy-Ramanujan and Rademacher series
Abstract
We prove that the partition function is log-concave for all . We then extend the results to resolve two related conjectures by Chen. The proofs are based on Lehmer's estimates on the remainders of the Hardy--Ramanujan and the Rademacher series for .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Advanced Combinatorial Mathematics · Analytic Number Theory Research
