Exact formulae for the fractional partition functions
Author(s)
Iskander, Jonas; Jain, Vanshika; Talvola, Victoria
Download40993_2020_195_ReferencePDF.pdf (351.2Kb)
Publisher Policy
Publisher Policy
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Terms of use
Metadata
Show full item recordAbstract
Abstract
The partition function p(n) has been a testing ground for applications of analytic number theory to combinatorics. In particular, Hardy and Ramanujan invented the “circle method” to estimate the size of p(n), which was later perfected by Rademacher who obtained an exact formula. Recently, Chan and Wang considered the fractional partition functions, defined for $$\alpha \in {\mathbb {Q}}$$α∈Q by $$\sum _{n = 0}^\infty p_{\alpha }(n)x^n := \prod _{k=1}^\infty (1-x^k)^{-\alpha }$$∑n=0∞pα(n)xn:=∏k=1∞(1-xk)-α. In this paper we use the Rademacher circle method to find an exact formula for $$p_\alpha (n)$$pα(n) and study its implications, including log-concavity and the higher-order generalizations (i.e., the Turán inequalities) that $$p_\alpha (n)$$pα(n) satisfies.
Date issued
2020-04-21Department
Massachusetts Institute of Technology. Department of MathematicsPublisher
Springer International Publishing
Citation
Research in Number Theory. 2020 Apr 21;6(2):20
Version: Author's final manuscript