A permutation which shifts all elements of a set by a fixed offset, with the elements shifted off the end inserted back at the beginning. For a set with elements , , ..., , a cyclic permutation of one place to the left would yield , ..., , , and a cyclic permutation of one place to the right would yield , , , ....

The mapping can be written as for a shift of places. A shift of places to the left is implemented in Mathematica as RotateLeft[list, k], while a shift of places to the right is implemented as RotateRight[list, k].

CITE THIS AS:

Weisstein, Eric W. "Cyclic Permutation." From MathWorld--A Wolfram Web Resource. http://mathworld.wolfram.com/CyclicPermutation.html