Cyclic Permutation - Definition 2

Definition 2

A permutation is called a cyclic permutation if and only if it will be constructed with exactly 1 cycle.

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) = 1

Example:

\begin{pmatrix} 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ 4 & 5 & 7 & 6 & 8 & 2 & 1 & 3 \end{pmatrix} = \begin{pmatrix} 1 & 4 & 6 & 2 & 5 & 8 & 3 & 7 \\ 4 & 6 & 2 & 5 & 8 & 3 & 7 & 1 \end{pmatrix} = (14625837)

Read more about this topic:  Cyclic Permutation

Famous quotes containing the word definition:

    “Perhaps the best definition of progress would be the continuing efforts of men and women to narrow the gap between the convenience of the powers that be and the unwritten charter.”
    —Nadine Gordimer (b. 1923)