Meinardus' theorem on weighted partitions: extensions and a probabilistic proof

Boris L. Granovsky, Dudley Stark, Michael Erlihson

Published 2007-01-21, updated 2007-11-29Version 2

We give a probalistic proof of the famous Meinardus' asymptotic formula for the number of weighted partitions with weakened one of the three Meinardus' conditions, and extend the resulting version of the theorem to other two classis types of decomposable combinatorial structures, which are called assemblies and selections. The results obtained are based on combining Meinardus' analytical approach with probabilistic method of Khitchine.