Cyclic permutation
From Biocrawler, the free encyclopedia.
A cyclic permutation is a permutation that shifts all elements of given ordered set by a fixed offset, with the elements shifted off the end inserted back at the beginning in the same order, i.e., cyclically. In lay terms, a rotation.
For example, (3,4,5,6,1,2) is a cyclic permutation of (1,2,3,4,5,6) and vice versa.
Stirling numbers of the first kind, s(n, k) count the number of permutations of n elements with k disjoint cycles
- See also: Caesar cipher
