Developments in the Khintchine-Meinardus probabilistic method for asymptotic enumeration

Original · EN

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 ∏ₖ₌₁∞ S(zᵏ) for partitions, where S(z)=(1-z)⁻¹. By applying a method due to Khintchine, we extend Meinardus' theorem to find the asymptotics of the coefficients of generating functions of the form ∏ₖ₌₁∞ S(aₖzᵏ)ᵇᵏ for sequences aₖ, bₖ and general S(z). We also reformulate the hypotheses of the theorem in terms of generating functions. This allows us to prove rigorously the asymptotics of Gentile statistics and to study the asymptotics of combinatorial objects with distinct components.