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:
“We have dancing ... from soon after sundown until a few minutes after nine o’clock.... Occasionally the boys who play the female partners in the dances exercise their ingenuity in dressing to look as girlish as possible. In the absence of lady duds they use leaves, and the leaf-clad beauties often look very pretty and always odd enough.”
—Rutherford Birchard Hayes (1822–1893)
“The cycle of the machine is now coming to an end. Man has learned much in the hard discipline and the shrewd, unflinching grasp of practical possibilities that the machine has provided in the last three centuries: but we can no more continue to live in the world of the machine than we could live successfully on the barren surface of the moon.”
—Lewis Mumford (1895–1990)