= Ordered set partition
= Set composition
{synonym}
An <ordered set partition> of a finite <set> $S$ is a <tuple> $(B_1,\ldots,B_k)$ of nonempty, pairwise <disjoint> <subsets> whose <union> is $S$. Elements inside each <block of a set partition> are unordered, but exchanging two blocks changes the <ordered set partition>. Thus $(\{1,2\},\{3\})$ and $(\{3\},\{1,2\})$ differ. For $|S|=n$, there are $k!S(n,k)$ such objects with $k$ blocks: first choose a <set partition> using the <Stirling number of the second kind>, then order its blocks in $k!$ ways. The unique <ordered set partition> of the <empty set> has zero blocks.
Back to article page