Cyclic permutation
Encyclopedia : C : CY : CYC : Cyclic permutation
The notion cyclic permutation is used in different but similar ways:
Definition 1

- the elements of S may be ordered (c[1] < c[2] < ... < c[k]) and the mapping of P may be written as:
- p(c[i] ) = c[i + t] for i = 1, 2, ..., k − t, and
- p(c[i]) = c[i + t − k] for i = k − t + 1, k − t + 2, ..., k.
Cyclic permutations of definition type 1 are also called rotations.
Example:
- [\begin 1 & 2 & 3 & 4 & 5 & 7 & 6 & 8 \\ 3 & 4 & 5 & 7 & 6 & 8 & 1 & 2 \end]
Definition 2

Note: Every permutation over a set with k elements is a cyclic permutation of definition type 2 if and only if
- it is a cyclic permutation of definition type 1 with gcd(k, offset) is prime
- it is a cyclic permutation of definition type 1 with offset = 1
Example:
- [\begin 1 & 2 & 3 & 4 & 5 & 7 & 6 & 8 \\ 4 & 5 & 7 & 6 & 8 & 1 & 2 & 3 \end =\begin 1 & 4 & 6 & 2 & 5 & 8 & 3 & 7 \\ 4 & 6 & 2 & 5 & 8 & 3 & 7 & 1 \end]
Definition 3

Note: Every cyclic permutation of definition type 3 may be seen as an union of a cyclic permutation of definition type 2 and some fixed points.
- Every cyclic permutation of definition type 2 may be seen as a
Example:
- [\begin 1 & 4 & 6 & 8 & 3 & 7 & 2 & 5 \\ 4 & 6 & 8 & 3 & 7 & 1 & 2 & 5 \end]
See also
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.
