UDK 512.54
ESTIMATING THE NUMBER OF 12-APERIODIC WORDS
V. I. Senashov
Institute of Computational Modeling SB RAS 50/44, Akademgorodok, Krasnoyarsk, 660036, Russian Federation Siberian Federal University 79, Svobodniy Av., Krasnoyarsk, 660041, Russian Federation
In 1902 W. Burnside raised the issue of local finiteness of groups, all elements of which are of finite order. A negative answer was obtained only 63 years later by E. S. Golod. Then S. V. Aleshin, R. I. Hryhorczuk, V. I. Sushchanskii proposed a series of negative examples. Finiteness of the free Burnside group of period n was established for n = 2, n = 3 (W. Burnside), n = 4 (W. Burnside, I. N. Sanov), n = 6 (M. Hall). The proof of infinity of this group for odd n ≥ 4381 was given in the article by P. S. Novikov and S. I. Adian (1967), and for odd n ≥ 665 in the book by S. I. Adian (1975). A more intuitive version of the proof for odd n > 1010 was proposed by A. Yu. Olshansky (1989). For n = 12 the answer is still unknown. A. S. Mamontov installed local finiteness of the group of period 12 without the elements of order 12. This result generalizes Theorems of I. N. Sanov and M. Hall. D. V. Lytkina, V. D. Mazurov and A. S. Mamontov proved that the group of period 12, in which the order of the product of any two elements of order two is not greater than 4, is locally finite. This theorem generalizes Theorem of I. N. Sanov, where the group of period 12 without elements of order 6 is locally finite. In relation with these results we consider the set of 12-aperiodic words. The word is called l-aperiodic if there are no non-empty subwords of the form Yl in it. In the monograph by S. I. Adian (1975) it was shown the proof of S. E. Arshon (1937) of the fact that in the two letters alphabet there is an infinite set of arbitrarily long 3-aperiodic words. In the book by A. Yu. Olshansky (1989) the theorem on the infinity of the set of 6-aperiodic words was proved, and a lower bound function for the number of words of a given length was obtained. Our aim is to get an estimate for the function f (n) of the number of 12-aperiodic words of the length n. The results can be applied when encoding information in space communications.
Keywords: group, periodic word, aperiodic word, alphabet, local finiteness.
References

1. Burnside W. On the unsettled question in the theory of discontinuous groups. Quart. J. Pure. Appl. Math. 1902, Vol. 33, P. 230–238.

2. Golod E. S. [On nil-algebras and finitely approximable groups]. Izv. AN SSSR, Ser. mat. 1964, No. 2 (28), P. 273–276 (In Russ.).

3. Aleshin S. V. [Finite automats and the Burnside problem on periodic groups]. Mat. Zametki. 1972, Vol. 11, No 3, P. 319–328 (In Russ.).

4. Grigorchuk R. I. [On Burnside problem for periodic groups]. Funktsion. analiz i yego pril. 1980, No. 1(14), P. 53–54 (In Russ.).

5. Sushchanskii V. I. [Periodic district permutation groups and unlimited Burnside problem]. DAN SSSR. 1979, Vol. 247, P. 557–560 (In Russ.).

6. Sanov I. N. [Solving the problem of Burnside for exponent 4]. Uch. Zap. LSU. 1940, Vol. 55, P. 166–170 (In Russ.).

7. Hall M. Teoriya grupp [Group Theory]. Moscow, Inostrannaya literatura Publ., 1962, 468 p.

8. Novikov P. S., Adyan S. I. [On infinite periodic groups. I-III]. Izv. AN SSSR. Ser. mat. 1968, No. 1(32), P. 212–244, No. 2(32), pp. 251–524, No. 3(32), pp. 708– 731 (In Russ.).

9. Adyan S. I. Problema Bernsayda i tozhdestva v gruppakh [Bernside Problem and Identities in Groups]. Moscow, Nauka Publ., 1975, 336 p.

10. Olshansky A. Yu. [Groups of limited period with subgroups of prime order]. Algebra i logika. 1982, No. 5(21), P. 555–618 (In Russ.).

11. Mamontov A. S. [Groups of period 12 without elements of order 12]. Sib. mat. zhurnal. 2013, No. 1(54), P. 150–156 (In Russ.).

12. Lytkina D. V., Mazurov V. D., Mamontov A. S. [The local finiteness of some groups of period 12]. Sib. matem. zhurn. 2012, No. 6(53), P. 1373–1378 (In Russ.).

13. Senashov V. I. [Aperiodic words]. Reshetnevskiye chteniya: materialy XIX Mezhdunar. nauch.-prakt. konf., posvyashch. 55-letiyu Sib. gos. aerokosmich. un-ta im. akad. M. F. Reshetneva [Reshetnev Readings: proceed. of XIX Intern. scientific and practical. conf. for 55th anniversary of Reshetnev Sib. State. Aerokosmich. Univ.] (10-14 Nov. 2015, Krasnoyarsk): 2 parts. Under total. Ed. Y. Y. Loginova; Sib. State. Aerokosmich. Univ, Krasnoyarsk, 2015, Part 2, P. 132–133 (In Russ.).

14. Senashov V. I. [Improved estimates of the number 6-aperiodic words of fixed length]. Sibirskii Gosudarstvennyi Aerokosmicheskii Universitet imeni Akademika M. F. Reshetneva. Vestnik. 2016, Vol. 17, No. 2, P. 168–172 (In Russ.).

15. Olshansky A. Yu. Geometriya opredelyayushchikh sootnosheniy v gruppakh [Geometry of defining relations in groups]. Moscow, Nauka Publ., 1989, 448 с.

16. Thue A. Uber unendliche Zeichenreih. Norcke Vid. Selsk. skr. I Mat. Nat. Kl. Christiania, 1906, Bd. 7, Iss. 1–22.

17. Arshon S. E. [Proof of existence of n-unit infinite asymmetric sequences]. Mat. sb. 1937, No. 4(2 (44)), P. 769–779 (In Russ.).

18. Kotliarov N. V. [On the words, avoiding the squares with a possible error of substitution]. Materialy Mezhdunar. molodezhn. nauch. foruma “Lomonosov- 2014” [Proceedings of the Intern. Youth Scientific Forum “Lomonosov-2014”]. Ed. A. I. Andreev, A. V. Andrianov, E. A. Antipov. [Electronic resource]. Moscow, MAX Press Publ., 2014 (In Russ.).

19. Gurevich G. A. [Nonrepetitive sequences]. Quant. 1975, No. 9, P. 7–11 (In Russ.).


Senashov Vladimir Ivanovich – Dr. Sc., professor, leader researcher of Institute, Computational Modeling SB

RAS; professor, Department of Algebra and Logic, Siberian Federal University. E-mail: sen1112home@mail.ru.