2014
DOI: 10.1016/j.jmaa.2014.02.061
|View full text |Cite
|
Sign up to set email alerts
|

Set partition asymptotics and a conjecture of Gould and Quaintance

Abstract: The main result of this paper is the generalization and proof of a conjecture by Gould and Quaintance on the asymptotic behavior of certain sequences related to the Bell numbers. Thereafter we show some applications of the main theorem to statistics of partitions of a finite set S, i.e., collections B 1 , B 2 , . . . , B k of non-empty disjoint subsets of S such that k i=1 B i = S, as well as to certain classes of partitions of [n].

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
9
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 3 publications
(5 reference statements)
1
9
0
Order By: Relevance
“…We treat the case when k is even, the odd case being similar which we leave to the reader. Let P * n,k denote the subset of P n,k consisting of π = 1π (1)(2) • • • kπ (k) satisfying the following conditions: (i) π (2) = π (4)…”
Section: Combinatorial Proof Of Corollarymentioning
confidence: 99%
See 2 more Smart Citations
“…We treat the case when k is even, the odd case being similar which we leave to the reader. Let P * n,k denote the subset of P n,k consisting of π = 1π (1)(2) • • • kπ (k) satisfying the following conditions: (i) π (2) = π (4)…”
Section: Combinatorial Proof Of Corollarymentioning
confidence: 99%
“…By [2], the coefficient of x n n! in e e x x 0 e −e t dt is given by B n (C +O(e −κn/ log n )), where C = 0.5963473622 • • • and κ is a positive constant.…”
Section: Combinatorial Proof Of Corollarymentioning
confidence: 99%
See 1 more Smart Citation
“…Once again, we make use of the saddle point method and the quasi-power theorem (Theorems 2.9 and 2.11). One can argue as in [1] to show that the integral in the generating function (12) can be extended to the range (0, ∞) at the expense of a small error term in the coefficients (cf. the proof of Corollary 2.24).…”
Section: The Case 123mentioning
confidence: 99%
“…We can focus on the part −e r −r dr dt of the generating function, since we have exact formulas for the rest. Integration by parts yields contributes O(1). For the rest, we can use a general result recently proven in[1]: namely, if g is an entire function in the complex plane with g(z) = O(e e (1−ϵ)|z| ) for some ϵ > 0 as |z| → ∞, then the coefficients of…”
mentioning
confidence: 99%