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:
“I happen to feel that the degree of a persons intelligence is directly reflected by the number of conflicting attitudes she can bring to bear on the same topic.”
—Lisa Alther (b. 1944)
“I cant quite define my aversion to asking questions of strangers. From snatches of family battles which I have heard drifting up from railway stations and street corners, I gather that there are a great many men who share my dislike for it, as well as an equal number of women who ... believe it to be the solution to most of this worlds problems.”
—Robert Benchley (18891945)
“The new shopping malls make possible the synthesis of all consumer activities, not least of which are shopping, flirting with objects, idle wandering, and all the permutations of these.”
—Jean Baudrillard (b. 1929)
“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)






