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.
Similar content being viewed by others
References
I. V. Grebennik and L. Yu. Yurchenko, “Ordering of permutations in solving combinatorial optimization problems with linear objective function,” Systemy Obrobky Informatsii, Issue 8 (66), 139–142 (2007).
V. A. Emelichev, M. M. Kovalev, and M. K. Kravtsov, Polyhedrons, Graphs, and Optimization [in Russian], Nauka, Moscow (1981).
Yu. G. Stoyan and S. V. Yakovlev, Mathematical Models and Optimization Methods of Geometrical Design [in Russian], Naukova Dumka, Kyiv (1986).
I. V. Grebennik, A. V. Pankratov, A. M. Chugay, and A. V. Baranov, “Packing n-dimensional parallelepipeds with the feasibility of changing their orthogonal orientation in an n-dimensional parallelepiped,” Cybern. Syst. Analysis, 46, No. 5, 793–802 (2010).
R. Stanley, Enumerative Combinatorics, Cambridge Univ. Press (2011).
Yu. G. Stoyan and O. O. Emets, Theory and Methods of Euclidean Combinatorial Optimization [in Ukrainian], Inst. Syst. Doslidzh. Osvity, Kyiv (1993).
N. V. Semenova, L. N. Kolechkina, A. N. Nagirna, “An approach to solving discrete vector optimization problems over a combinatorial set of permutations,” Cybern. Syst. Analysis, 44, No. 3, 441–451 (2008).
M. Bona, Combinatorics of Permutations, Chapman & Hall/CRC, Boca Raton (2004).
D. L. Kreher and D. R. Stinson, Combinatorial Algorithms: Generation Enumeration and Search, CRC Press, Boca Raton (1999).
I. V. Grebennik and A. S. Lytvynenko, “Generating combinatorial sets with given properties,” Cybern. Syst. Analysis, 48, No. 6, 890–898 (2012).
I. V. Grebennik, “Description and generation of permutations containing cycles,” Cybern. Syst. Analysis, 46, No. 6, 945–952 (2010).
D. Knuth, The Art of Computer Programming, Vol. 4: Fascicle 2: Generating All Tuples and Permutations, Addison-Wesley, Stanford (2005).
Yu. A. Isachenko, “Application of the polyhedral approach to the problem over cyclic permutations,” in: Modern Computer Information Technologies [in Russian], Vol. 2, GrGU, Grodno (2008), pp. 203–206.
I. V. Grebennik and O. S. Chorna, “Cyclic properties of adjacent permutations of different elements,” Bionika Intellekta, No. 1 (82), 7–11 (2014).
I. V. Grebennik and O. S. Chorna, “Transposition of components and their influence on the cyclic structure of permutations,” in: Proc. ICAICTSEE-2014, UNWE, Sofia, Bulgaria (2014).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, November–December, 2015, pp. 128–136.
Rights and permissions
About this article
Cite this article
Grebennik, I.V., Chorna, O.S. Influence of Certain Transpositions on the Cyclic Structure of Permutations. Cybern Syst Anal 51, 947–955 (2015). https://doi.org/10.1007/s10559-015-9787-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10559-015-9787-9