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:
“My idea is that the world outsidethe so-called modern worldcan only pervert and degrade the conceptions of the primitive instinct of art and feeling, and that our only chance is to accept the limited number of survivorsthe one- in-a-thousand of born artists and poetsand to intensify the energy of feeling within that radiant centre.”
—Henry Brooks Adams (18381918)
“Not too many years ago, a childs experience was limited by how far he or she could ride a bicycle or by the physical boundaries that parents set. Today ... the real boundaries of a childs life are set more by the number of available cable channels and videotapes, by the simulated reality of videogames, by the number of megabytes of memory in the home computer. Now kids can go anywhere, as long as they stay inside the electronic bubble.”
—Richard Louv (20th century)
“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)
