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

From MaRDI portal
Publication:950408

DOI10.1016/J.AAM.2007.11.001zbMATH Open1148.60078arXivmath/0701584OpenAlexW1980712796MaRDI QIDQ950408FDOQ950408

Michael M. Erlihson, Dudley Stark, Boris Granovsky

Publication date: 22 October 2008

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/math/0701584




Recommendations




Cites Work


Cited In (20)





This page was built for publication: Meinardus' theorem on weighted partitions: Extensions and a probabilistic proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950408)