linguistic:voice_change, quality:correction, stylistic:tone, information:filtering
Circular permutations

Permutations, when considered as arrangements, are sometimes referred to as linearly ordered arrangements. If, however, the objects are arranged in a circular manner this distinguished ordering is weakened: there is no "first element" in the arrangement, as any element can be considered as the start. An arrangement of distinct objects in a circular manner is called a circular permutation. These can be formally defined as equivalence classes of ordinary permutations of these objects, for the equivalence relation generated by moving the final element of the linear arrangement to its front.

Two circular permutations are equivalent if one can be rotated into the other. The following four circular permutations on four letters are considered to be the same.

The circular arrangements are to be read counter-clockwise, so the following two are not equivalent since no rotation can bring one to the other.

There are (n – 1)! circular permutations of a set with n elements.