Ordered set partition Created 2026-10-20 Updated 2026-11-05
An ordered set partition of a finite set is a tuple of nonempty, pairwise disjoint subsets whose union is . Elements inside each block of a set partition are unordered, but exchanging two blocks changes the ordered set partition. Thus and differ. For , there are such objects with blocks: first choose a set partition using the Stirling number of the second kind, then order its blocks in ways. The unique ordered set partition of the empty set has zero blocks.