This is a preview of subscription content, log in via an institution to check access.
References
H. S. M. Coxeter and W. O. J. Moser, Generators and Relations for Discrete Groups, Springer, Berlin (1972).
V. M. Glushkov, “On completeness of the operation set in electronic computers,” Kibernetika, No. 2, 1–5 (1968).
Yu. V. Kapitonova, “Estimating the microprogram length in one algebra of microprograms,” Kibernetika, No. 1, 101–102 (1969).
Yu. V. Golunkov, “On complexity of representation of the permutations of a symmetric semigroup in terms of the elements of the generator system,” Kibernetika, No. 1, 43–44 (1971).
B. A. Pogorelov, “On a problem of V. M. Glushkov,” Kibernetika, No. 5, 141–143 (1973).
V. A. Rubtsov, “On some estimates of the measure of information redundancy of generator systems generating a symmetric permutation group,” Kibernetika, No. 5, 51–55 (1975).
N. K. Kasabov and G. T. Bizhev, “Minimal representation of a symmetric group close to a maximally compact representation,” Kibernetika, No. 3, 135–136 (1980).
W. Magnus, A. Karras, and D. Solitar, Combinatorial Group Theory. Presentations of Groups in Terms of Generators and Relations, Wiley Interscience, New York (1966).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 39–47, November–December, 1992.
Rights and permissions
About this article
Cite this article
Lazarev, A.G. Generation of a symmetric group by systems of generators: Simulation results. Cybern Syst Anal 28, 840–845 (1992). https://doi.org/10.1007/BF01291286
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01291286