Purchase Solution

Recurrence Relations : Stirling Numbers

Not what you're looking for?

Ask Custom Question

A Stirling number Snk is definedc as the number of ways of partitioning the set of positive numbers (1,2,3,....n) into k non empty subsets.

We can show that by considering if the singleton subset (n) is a partition or not that Snk = Sn-1, k-1 + kSn-1,k

Another recurrence relation comes from considering the number of partitions that have:

(i) either (n,n-1) or both (n) and (n-1) as subsets
(ii) either (n) or (n-1) but not both as subsets
(iii) none of (n,n-1) (n) (n-1) as subsets

Show this leads to

Snk = Sn-2, k-2 + (2k-1)Sn-2,k-1 + k^2Sn-2,k

Purchase this Solution

Solution Summary

Recurrence Relations and Stirling Numbers are investigated.

Solution Preview

Please see the attached file for the complete solution.
Thanks for using BrainMass.

Proof:
is the number of ways to partition the set into subsets.
Now we want to show that

We consider the last two ...

Purchase this Solution


Free BrainMass Quizzes
Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Multiplying Complex Numbers

This is a short quiz to check your understanding of multiplication of complex numbers in rectangular form.

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

Probability Quiz

Some questions on probability