Ordered Partition Of A Set

In 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:
T_n=\sum_{i=0}^{n-1} {n \choose i} T_i.
Furthermore, the exponential generating function is
\sum_n {T_n \over n!} x^n = {1 \over 2-e^x}.

 

<< PreviousWord BrowserNext >>
memoir of halldr laxness
james farley
uss adirondack (1917)
periodic table (chinese)
uss adirondack (agc 15)
the thirty six dramatic situations
list of stopper knots
enzyme activity
stanford research park
enzyme unit
magma design automation
nessler's reagent
alberta alliance party
thirty six dramatic situations (book)
the adventure of the highgate miracle
rankit
oral consonant
georges polti
central consonant
bernie parent
brake (box and pan)
complement system
scone, perthshire
william stevens fielding
nuray hafiftas
mystery park
the pelican brief
the adventure of the black baronet
galactoside
insecula
antler subway records
de havilland gipsy major
charles gavan power
boys don't cry (album)
clark's anemonefish
boys don't cry (movie)
play it again sam
william jackson palmer
phoenix islands
george perry graham
the adventure of the sealed room
wilhelm ritter von leeb
jnanayasas
john james greene