|
|
|
|
|
Ordered Partition Of A SetIn mathematics, an ordered partition O of a set S is a sequence - A1, A2, A3, ..., An
of subsets of S, with union is S, which are non-empty, and pairwise disjoint. This definition differs from a partition of a set, in that the order of the Ai matters. For example, one ordered partition of { 1, 2, 3, 4, 5 } is - {1, 2} {3, 4} {5}
which is equivalent to - {1, 2} {4, 3} {5}
but distinct from - {3, 4} {1, 2} {5}.
The number of ordered partitions Tn of { 1, 2, ..., n } can be found recursively by the formula: -
Furthermore, the exponential generating function is -
|
 |
|
| Copyright 2005-2009 OnPedia.com. All Rights Reserved |
|
|