×

Modeling of periodic groups involving independent words. (English. Russian original) Zbl 1307.90151

Autom. Remote Control 73, No. 2, 392-396 (2012); translation from Sist. Upr. Inf. Tekh. 2008, No. 2, 286-289 (2008).
Summary: This paper suggests a certain algorithm to model periodic groups based on calculation of independent words.

MSC:

90C27 Combinatorial optimization
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Kuznetsov, A.A., Tarasov, S.A., and Tukhvatullina, L.R., Group Calculation Algorithm, in Matematicheskie sistemy (Mathematical Systems), Krasnoyarsk: Gos. Aerokosm. Univ., 2007, vol. 6, pp. 63–73.
[2] Kuznetsov, A.A., On the Finiteness Issue of Free Burnside Group B(2, 5), in Matematicheskie sistemy (Mathematical Systems), Krasnoyarsk: Gos. Aerokosm. Univ., 2005, vol. 5, pp. 38–47.
[3] Kostrikin, A.I., Vokrug Bernsaida (Around Burnside), Moscow: Nauka, 1983.
[4] Kourovskaya tetrad’: nereshennye voprosy teorii grupp (Kourov Notebook: Unsolved Problems in the Group Theory), Novosibirsk: Inst. Mat., 2006.
[5] Kuznetsov, A.A. and Shlepkin, A.K., Using Parallel Computations to Find Elements in Free Burnside Groups B(m, n), Tr. IV mezhregion. shkoly-seminara ”Raspredelennye i klasternye vychisleniya” (Proc. IV Inter-regional Learning Seminar ”Distributed and Cluster Computing”), Krasnoyarsk: Inst. Vychisl. Mat., Ross. Akad. Nauk, 2005, pp. 36–40.
[6] Lytkina, D.V. and Kuznetsov, A.A., Recognizability by Spectrum of the Group L 2(7) in the Class of All Groups, Sib. Electr. Math. Reports, 2007, vol. 6, pp. 136–140. · Zbl 1134.20009
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.