<-- Back to the home page

Associated Bell Numbers

Bn≤mB_{n\leq m} is the number of partitions of an nn element set such that every block in any partition contains at least mm elements.

They are the sum of the Associated Stirling Numbers for all values k∈{1...n}k \in \{1...n\}

Basic Recurrence

B0≥m=1B_{0 \geq m} = 1

Bn≥m=0 for m>n>0B_{n \geq m} = 0 \text{ for } m > n > 0

Bn,≥k=Bn,≥k−1−∑i=1⌊nk−1⌋n!(k−1)!i!(n−(k−1)i)!Bn−(k−1)i,≥k.B_{n, \geq k} = B_{n, \geq k-1} - \sum_{i=1}^{\left\lfloor \frac{n}{k-1} \right\rfloor} \frac{n!}{(k-1)!i!(n-(k-1)i)!} B_{n-(k-1)i, \geq k}.

Formulas

There is no known formula for the general case.

Generating functions

Exponential generating function

∑n=0∞Bn≥mxnn!=exp⁡(exp⁡(x)−∑i=0m−1xii!)\sum_{n=0}^{\infty} \frac{B_{n \geq m} x^n}{n!} = \exp \left( \exp(x) - \sum_{i=0}^{m-1} \frac{x^i}{i!} \right)

Relation to Bell and Associated Bell numbers

Where BnB_n is a Bell number and Bn≤mB_{n \leq m} is a Restricted Bell Number

Bn=∑i=0n(ni)∗Bi≤m∗Bn−i≥m+1B_n = \sum_{i=0}^{n}\binom{n}{i} * B_{i\le m} * B_{n-i\ge m+1}

Bn≥k=Bn−∑i=1n(ni)Bi≤k−1Bn−i≥k.B_{n \geq k} = B_{n} - \sum_{i=1}^{n} \binom{n}{i} B_{i \leq k-1} B_{n-i \geq k}.

∑i=0n(ni)Bi≥2=Bn.\sum_{i=0}^{n} \binom{n}{i} B_{i \geq 2} = B_{n}.

Bn=Bn≥1B_n = B_{n \geq 1}

Articles

Combinatorial and Arithmetical Properties of the Restricted and Associated Bell and Factorial Numbers