Exact formulae for the fractional partition functions.

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 α ∈ Q by ∑ n = 0 ∞ p α (n) x n : = ∏ k = 1 ∞ (1 - x k) - α . In this paper we use the Rademacher circle method to find an exact formula for p α (n) and study its implications, including log-concavity and the higher-order generalizations (i.e., the Turán inequalities) that p α (n) satisfies. [ABSTRACT FROM AUTHOR]