Abstract
In this paper, the recurrent algorithms for construction of generating ordered set of symmetric group are suggested. The bounds of transpositions’ numbers in such sets are found.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Sadovskii, L.E., The Algebraization of a Problem in the Theory of the Control of Calculating Automata, Usp. Mat. Nauk, 1947, vol. 11, no. 6(22), pp. 223–226.
Lazarev, V.G. and Sagalovich, Yu.L., The Commutator of Machine for Synthesis of Relay-Contact Circuits, Probl. Peredachi Inf., 1959, no. 4, pp. 124–132.
Author information
Authors and Affiliations
Additional information
Original Russian Text © S.A. Kalinchuk, Yu.L. Sagalovich, 2009, published in Avtomatika i Telemekhanika, 2009, No. 2, pp. 142–152.
Rights and permissions
About this article
Cite this article
Kalinchuk, S.A., Sagalovich, Y.L. Generating ordered set of symmetric group for solving commutation problems. Autom Remote Control 70, 301–311 (2009). https://doi.org/10.1134/S0005117909020118
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0005117909020118