## 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:

It was last updated .