2008
DOI: 10.1016/j.aam.2007.11.001
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: The number c n of weighted partitions of an integer n, with parameters (weights) b k , k 1, is given by the generating function relationship ∞ n=0 c n z n = ∞ k=1 (1 − z k ) −b k . Meinardus (1954) established his famous asymptotic formula for c n , as n → ∞, under three conditions on power and Dirichlet generating functions for the sequence b k . We give a probabilistic proof of Meinardus' theorem with weakened third condition and extend the resulting version of the theorem from weighted partitions to other t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
83
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 29 publications
(85 citation statements)
references
References 18 publications
2
83
0
Order By: Relevance
“…using the saddle-point method [14], where s = σ + it is a complex variable. Granovsky, Stark, and Erlihson [17] extended Meinardus' theorem to new multiplicative combinatorial objects using Khintchine's probabilistic method [20]. Granovsky and Stark [16] later generalized their results to weighted partitions such that D(s) has multiple singularities on the positive real axis, which includes the class of Bose-Einstein condensates.…”
Section: Khintchine-meinardusprobabilisticmethodsmentioning
confidence: 99%
“…using the saddle-point method [14], where s = σ + it is a complex variable. Granovsky, Stark, and Erlihson [17] extended Meinardus' theorem to new multiplicative combinatorial objects using Khintchine's probabilistic method [20]. Granovsky and Stark [16] later generalized their results to weighted partitions such that D(s) has multiple singularities on the positive real axis, which includes the class of Bose-Einstein condensates.…”
Section: Khintchine-meinardusprobabilisticmethodsmentioning
confidence: 99%
“…There are more general Meinardus methods for computing asymptotics of the coefficients of classes of partition number generating functions of the form [10] n≥0…”
Section: 3mentioning
confidence: 99%
“…According to the representation (2.1) and independence of {D j } under the measure µ q z,k (see Section 2), the weight N(λ) of partition λ ∈ Λ q is the sum of k → ∞ independent random variables, so one may expect a local limit theorem to hold (cf. [6,41,16,17]). For our purposes, it suffices to obtain an asymptotic lower bound for the probability of the event {N(λ) = n}.…”
Section: A1 Auxiliary Lemmasmentioning
confidence: 99%