Developments in the Khintchine-Meinardus Probabilistic Method for Asymptotic Enumeration

A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler’s generating function ∏∞ k=1 S(z k) for partitions, where S(z) = (1 − z)−1. By applying a method due to Khintchine, we extend Meinardus’ theorem to find the asymptotics of the Taylor coefficients of generating functions of the form ∏∞ k=1 S(akz k)bk for sequences ak, bk and general S(z). We also reformulate the hypotheses of the theorem in terms of the above generating functions. This allows novel applications of the method. In particular, we prove rigorously the asymptotics of Gentile statistics and derive the asymptotics of combinatorial objects with distinct components.