Difference between revisions of "Stirling number"

m (Stirling numbers moved to Stirling number: singular)
Line 1: Line 1:
There are two kinds of Stirling numbers: '''Stirling numbers of the first kind''' and '''Stirling numbers of the second kind'''. They appear in many combinatoric problems.
+
{{stub}}
 +
 
 +
There are two kinds of Stirling numbers: '''Stirling numbers of the first kind''' and '''Stirling numbers of the second kind'''. They appear in many situations in [[combinatorics]].
  
  
 
== Stirling Numbers of the First Kind ==
 
== Stirling Numbers of the First Kind ==
 +
The Stirling number of the first kind, <math>S_1(n, k)</math>, is the number of [[permutation]]s of an <math>n</math>-[[element]] [[set]] with exactly <math>k</math> [[cycle of a permutation | cycles]]. 
  
Counts the number of permutations of n elements with exactly k cycles.
+
For example, <math>S_1(4, 2) = 11</math> because (writing all our permutations in [[cycle notation]]) we have the permutations <math>\{(1)(234), (1)(243), (134)(2),(143)(2),(124)(3),(142)(3),(123)(4),(132)(4), (12)(34), (13)(24), (14)(23)\}</math>.
 
 
 
 
  
 
== Stirling Numbers of the Second Kind ==
 
== Stirling Numbers of the Second Kind ==
 +
The Stirling number of the second kind, <math>S_2(n, k)</math>, is the number of [[partition]]s of an <math>n</math>-element set into exactly <math>k</math> [[subset]]s.
  
Counts the number of partitions of {1, 2, . . . n} into exactly k subsets.
+
For example, <math>S_2(4, 2) = </math> because we have the partitions <math>\{1 | 234, 2|134, 3|124, 4|123, 12|34, 13|24, 14|23\}</math>.

Revision as of 13:16, 9 November 2006

This article is a stub. Help us out by expanding it.

There are two kinds of Stirling numbers: Stirling numbers of the first kind and Stirling numbers of the second kind. They appear in many situations in combinatorics.


Stirling Numbers of the First Kind

The Stirling number of the first kind, $S_1(n, k)$, is the number of permutations of an $n$-element set with exactly $k$ cycles.

For example, $S_1(4, 2) = 11$ because (writing all our permutations in cycle notation) we have the permutations $\{(1)(234), (1)(243), (134)(2),(143)(2),(124)(3),(142)(3),(123)(4),(132)(4), (12)(34), (13)(24), (14)(23)\}$.

Stirling Numbers of the Second Kind

The Stirling number of the second kind, $S_2(n, k)$, is the number of partitions of an $n$-element set into exactly $k$ subsets.

For example, $S_2(4, 2) =$ because we have the partitions $\{1 | 234, 2|134, 3|124, 4|123, 12|34, 13|24, 14|23\}$.