Random Permutation Statistics - Number of Permutations That Are Involutions

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 σ ∈ S_n:

$I(n) = n! g(z) = n! \sum_{a+2b=n} \frac{1}{a! \; 2^b \; b!} = n! \sum_{b=0}^{\lfloor n/2 \rfloor} \frac{1}{(n-2b)! \; 2^b \; b!}.$

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:

“To finish the moment, to find the journey’s end in every step of the road, to live the greatest number of good hours, is wisdom. It is not the part of men, but of fanatics, or of mathematicians, if you will, to say, that, the shortness of life considered, it is not worth caring whether for so short a duration we were sprawling in want, or sitting high. Since our office is with moments, let us husband them.”
—Ralph Waldo Emerson (1803–1882)

“As equality increases, so does the number of people struggling for predominance.”
—Mason Cooley (b. 1927)

“Motherhood in all its guises and permutations is more art than science.”
—Melinda M. Marshall (20th century)