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:
“This nightmare occupied some ten pages of manuscript and wound off with a sermon so destructive of all hope to non-Presbyterians that it took the first prize. This composition was considered to be the very finest effort of the evening.... It may be remarked, in passing, that the number of compositions in which the word beauteous was over-fondled, and human experience referred to as lifes page, was up to the usual average.”
—Mark Twain [Samuel Langhorne Clemens] (18351910)
“Today, almost forty years later, I grow dizzy when I recall that the number of manufactured tanks seems to have been more important to me than the vanished victims of racism.”
—Albert Speer (19051981)
“Motherhood in all its guises and permutations is more art than science.”
—Melinda M. Marshall (20th century)
