Generate Permutations

What Type?

All permutations of [n] = {1,2,..., n}.     All k-permutations of {1,2,...n}.     All permutations [n] by Transpositions     Derangements of [n], [with k cycles].     Involutions of [n].     With k cycles.     With given cycle structure, (ni = number of i cycles.)     With maximum cycle length k.     With k left to right maxima.     With given ups and downs.     Stamp Foldings, restricted to all first less than last unlabelled meanders closed meanders (2n)     Permutations of [n] with k inversions     Permutations of [n] with index k     Dumont (Genocchi) sequences of the first kind     Dumont (Genocchi) sequences of the second kind

Input: (1 <= k <= n <= 50) (0 <= k <= C(n,2) for Inversions and Index)
n =	k =

Cycle Structure Information:
n1 =	n2 =	n3 =
n4 =	n5 =	n6 =

Output:
One line notation     Cycle notation     Transposition (if applicable)     Permutation matrix (chess board)     Inverse Permutation     Standard Young Tableau     Diagram (if applicable)

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:13 PDT.
There have been 13570 visitors to this page since May 16, 2000 .
©Frank Ruskey, 1995-2003.