Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Let $S_i (n,k)$ denote the number of partitions of $[n]$ into $k$ blocks where each block contains at least $i$ elements. Give a combinatorial proof of the following recurrence relation:

$$S_i (n,k) = k S_i (n-1, k)+ \binom {n-1}{i-1} S_i(n-i,k-1) $$

Please help!

share|improve this question

1 Answer 1

up vote 2 down vote accepted

The element $n$ is either in a block with exactly $i$ elements or in a block with more than $i$ elements. To generate all partitions where $n$ is in a block with more than $i$ elements, take the partitions of $[n-1]$ into $k$ blocks with at least $i$ elements each and add $n$ to any one of the $k$ blocks – that accounts for the first term. To generate all partitions where $n$ is in a block with exactly $i$ elements, choose $i-1$ elements from $[n-1]$ that are in the same block as $n$ and a partition of the remaining $n-i$ elements into $k-1$ blocks with at least $i$ elements each – that accounts for the second term.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.