Info on Maximum Cycle Length

Information on permutations with maximum cycle length k

It is well known that permutation of [n]={1,2,...,n} can be written uniquely (up to re-ordering) as a product of disjoint cycles. The objects generated here are all permutations of [n] that have no cycles of length longer than k. When k=2, these permutations are called Involutions.

The algorithm used is from the paper: U. Taylor and F. Ruskey, Fast Generation of Restricted Classes of Permutations, Manuscript 1995.

Programs available:

C program
Pascal program

Questions?? Email The wizard of COS.

(Please note that the suffix XXXX must be removed from the preceeding email address.)
It was last updated Wednesday, 10-May-2006 10:32:14 PDT.
There have been 5351 visitors to this page since May 16, 2000 .
©Frank Ruskey, 1995-2003.