Stirling numbers of the first kind
ID: stirling-numbers-of-the-first-kind
The unsigned Stirling numbers of the first kind count permutations of labels having exactly disjoint permutation cycles, including fixed points as one-cycles. Their signed version is . Equivalently,The sign convention must be stated because both versions are standard. For three labels, the unsigned counts for are : two three-cycles, three transpositions with one fixed point, and the identity permutation. This cycle count differs from the Stirling number of the second kind, which counts unordered nonempty blocks without a cyclic order inside each block.
Stirling numbers of the first kind, denoted by \(c(n, k)\), count the number of ways to express a permutation of \(n\) elements as a product of \(k\) disjoint cycles. In other words, they are used in combinatorial mathematics to determine how many different ways a set can be partitioned into cycles.
New to topics? Read the docs here!