Odd Cycle Invariants
The types of permutations presented in the preceding two sections, i.e. permutations containing an even number of even cycles and permutations that are squares, are examples of so-called odd cycle invariants, studied by Sung and Zhang (see external links). The term odd cycle invariant simply means that membership in the respective combinatorial class is independent of the size and number of odd cycles occurring in the permutation. In fact we can prove that all odd cycle invariants obey a simple recurrence, which we will derive. First, here are some more examples of odd cycle invariants.
Read more about this topic: Random Permutation Statistics
Famous quotes containing the words odd and/or cycle:
“‘Tis not such lines as almost crack the stage
When Bajazet begins to rage;
Nor a tall met’phor in the bombast way,
Nor the dry chips of short-lunged Seneca.
Nor upon all things to obtrude
And force some odd similitude.
What is it then, which like the power divine
We only can by negatives define?”
—Abraham Cowley (1618–1667)
“The Buddha, the Godhead, resides quite as comfortably in the circuits of a digital computer or the gears of a cycle transmission as he does at the top of a mountain or in the petals of a flower.”
—Robert M. Pirsig (b. 1928)