cyclic permutation




For a finite set XX, a cyclic permutation on XX is a permutation σ:XX\sigma \colon X \to X such that the induced group homomorphism Aut(X)\mathbb{Z} \to Aut(X) from the integers to the automorphism group (i.e. the symmetric group) of XX, sending nn \in \mathbb{Z} to σ n\sigma^n, defines a transitive action.

One may visualize the elements of XX as points arranged on a circle spaced equally apart, with σ(x)\sigma(x) the next-door neighbor of xx in the counterclockwise direction, hence the name.

See also rotation permutation.


See also:

Last revised on April 18, 2021 at 12:19:27. See the history of this page for a list of all contributions to it.