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. In mathematics, especially in abstract algebra and related areas, a permutation is a bijection, from a finite set X onto itself. ... ... This article is about rotation as a movement of a physical body. ...

For example, (3,4,5,6,1,2) is a cyclic permutation of (1,2,3,4,5,6) and vice versa.

Stirling numbers s(n,k) count the number of permutations of n elements with k disjoint cycles Stirling numbers of the first kind In combinatorics, unsigned Stirling numbers of the first kind s(n,k) (with a lower-case s) count the number of permutations of n elements with k disjoint cycles. ... In mathematics, two sets are said to be disjoint if they have no element in common. ...

See also: Caesar cipher