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.
The unsigned Stirling number of the first kind is the number of permutations on labels with disjoint permutation cycles. It satisfies
with impossible indices giving zero. Either label forms its own cycle, or it is inserted immediately after one of the old labels in an existing cycle; deleting reverses either construction. Thus . The same recurrence relation gives the coefficient identity .

Articles by others on the same topic (1)

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.