Abstract. The paper considers the features of the influence of certain kind of transpositions on cyclic permutations. Assertions about the result of the successive application of multiple relevant transpositions are proved. An algorithm for generating cyclic permutations based on the proved statements is proposed. Computational experiments are performed.

Keywords: set of permutations, permutation polyhedron, criterion of the adjacency, properties of permutations, transposition, combinatorics.