Number of Permutations Containing Cycles
Applying the Flajolet–Sedgewick fundamental theorem, i.e. the labelled enumeration theorem with, to the set
we obtain the generating function
The term
yields the Stirling numbers of the first kind, i.e. is the EGF of the unsigned Stirling numbers of the first kind.
We can compute the OGF of these numbers for n fixed, i.e.
Start with
which yields
Summing this, we obtain
Using the formula for on the left, the definition of on the right, and the binomial theorem, we obtain
Comparing the coefficients of, and using the definition of the binomial coefficient, we finally have
a falling factorial.
Read more about this topic: Random Permutation Statistics
Famous quotes containing the words number of, number, permutations and/or cycles:
“After mature deliberation of counsel, the good Queen to establish a rule and imitable example unto all posterity, for the moderation and required modesty in a lawful marriage, ordained the number of six times a day as a lawful, necessary and competent limit.”
—Michel de Montaigne (15331592)
“Without claiming superiority of intellectual over visual understanding, one is nevertheless bound to admit that the cinema allows a number of æsthetic-intellectual means of perception to remain unexercised which cannot but lead to a weakening of judgment.”
—Johan Huizinga (18721945)
“Motherhood in all its guises and permutations is more art than science.”
—Melinda M. Marshall (20th century)
“The stars which shone over Babylon and the stable in Bethlehem still shine as brightly over the Empire State Building and your front yard today. They perform their cycles with the same mathematical precision, and they will continue to affect each thing on earth, including man, as long as the earth exists.”
—Linda Goodman (b. 1929)