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:
“As Jerome expanded, its chances for the title, the toughest little town in the West, increased and when it was incorporated in 1899 the citizens were able to support the claim by pointing to the number of thick stone shutters on the fronts of all saloons, gambling halls, and other places of business for protection against gunfire.”
—Administration in the State of Ariz, U.S. public relief program (1935-1943)
“... [woman suffrage] has made little difference beyond doubling the number of voters. There is no womans vote as such. They divide up just about as men do.”
—Alice Roosevelt Longworth (18841980)
“Motherhood in all its guises and permutations is more art than science.”
—Melinda M. Marshall (20th century)
