Estimation of the number of aperiodic words
In 1902 W. Burnside raised the issue of local finiteness of groups, all elements of which are of finite order. The first negative answer was obtained in 1968 in the article by by P.S. Novikov and S.I. Adian. Finiteness of the free Burnside group of period n was established for n = 2, n = 3 (W. Burnside), n = 4 <sup>*</sup> This work is supported by the Krasnoyarsk Mathematical Center and financed by the Ministry of Science and Higher Education of the Russian Federation in the framework of the establishment and development of regional Centers for Mathematics Research and Education (Agreement No. 075-02-2021-1388). (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). In relation with these results we consider the set of m-aperiodic words. Word is called l-aperiodic if there are no non-empty subwords of the form Y<sup>l</sup> in it. In the monograph by S. I. Adian (1975) it was showen 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 m-aperiodic words of the length n in the two-letters alphabet. The results can be applied when encoding information in space communications.