Number of Permutations That Are Involutions
An involution is a permutation σ so that σ2 = 1 under permutation composition. It follows that σ may only contain cycles of length one or two, i.e. the EGF g(z) of these permutations is
This gives the explicit formula for the total number of involutions among the permutations σ ∈ Sn:
Dividing by n! yields the probability that a random permutation is an involution.
Read more about this topic: Random Permutation Statistics
Famous quotes containing the words number of, number and/or permutations:
“Strange goings on! Jones did it slowly, deliberately, in the bathroom, with a knife, at midnight. What he did was butter a piece of toast. We are too familiar with the language of action to notice at first an anomaly: the it of Jones did it slowly, deliberately,... seems to refer to some entity, presumably an action, that is then characterized in a number of ways.”
—Donald Davidson (b. 1917)
“A great number of the disappointments and mishaps of the troubled world are the direct result of literature and the allied arts. It is our belief that no human being who devotes his life and energy to the manufacture of fantasies can be anything but fundamentally inadequate”
—Christopher Hampton (b. 1946)
“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)
