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

Simple item page
dc.creatorGranovsky, Boris L.
dc.creatorStark, Dudley
dc.creatorErlihson, Michael
dc.date2007-01-21
dc.date2007-11-29
dc.date.accessioned2026-07-07T08:45:56Z
dc.date.available2026-07-07T08:45:56Z
dc.descriptionWe 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.
dc.descriptionThe version contains a few minor corrections.It will be published in Advances in Applied Mathematics
dc.identifierhttps://arxiv.org/abs/math/0701584
dc.identifierhttp://arxiv.org/abs/math/0701584
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/143121
dc.subjectProbability
dc.subjectCombinatorics
dc.subject60C05;05A16;60F05
dc.titleMeinardus' theorem on weighted partitions: extensions and a probabilistic proof
dc.typetext

Files

Collections

arXiv