I'm not entirely sure of what you are asking, but note that Erdos and Lehner proved here that
p(n,m)simfracnm−1m!(m−1)! holds for m=o(n1/3). In generality for any finite set A, with |A|=m and p(n,A) denoting the number of partitions of n with parts from A, one has
p(n,A)=frac1prodainAafracnm−1(m−1)!+O(nm−2).
Such estimations can be deduced from the generating function of p by using methods that are described in many books, for example "Analytic Combinatorics" by Flajolet and Sedgewick.
No comments:
Post a Comment