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 heartily wish you, in the plain home-spun style, a great number of happy new years, well employed in forming both your mind and your manners, to be useful and agreeable to yourself, your country, and your friends.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (16941773)
“Of all reformers Mr. Sentiment is the most powerful. It is incredible the number of evil practices he has put down: it is to be feared he will soon lack subjects, and that when he has made the working classes comfortable, and got bitter beer into proper-sized pint bottles, there will be nothing left for him to do.”
—Anthony Trollope (18151882)
“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)






