zbMATH — the first resource for mathematics

\(C^\ast\)-simplicity of \(n\)-periodic products. (English. Russian original) Zbl 1358.20033
Math. Notes 99, No. 5, 631-635 (2016); translation from Mat. Zametki 99, No. 5, 643-648 (2016).
Summary: The \(C^\ast\)-simplicity of \(n\)-periodic products is proved for a large class of groups. In particular, the \(n\)-periodic products of any finite or cyclic groups (including the free Burnside groups) are \(C^\ast\)-simple. Continuum-many nonisomorphic 3-generated nonsimple \(C^\ast\)-simple groups are constructed in each of which the identity \(x^n = 1\) holds, where \(n\geq1003\) is any odd number. The problem of the existence of \(C^\ast\)-simple groups without free subgroups of rank 2 was posed by P. de la Harpe [Bull. Lond. Math. Soc. 39, No. 1, 1–26 (2007; Zbl 1123.22004)].

20F50 Periodic groups; locally finite groups
20E06 Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations
20F05 Generators, relations, and presentations of groups
22D25 \(C^*\)-algebras and \(W^*\)-algebras in relation to group representations
43A07 Means on groups, semigroups, etc.; amenable groups
46L05 General theory of \(C^*\)-algebras
Full Text: DOI
[1] de laHarpe, P., On simplicity of reducedc*-algebras of groups, Bull. Lond. Math. Soc., 39, 1-26, (2007) · Zbl 1123.22004
[2] Day, M. M., Amenable semigroups, Illinois J.Math., 1, 509-544, (1957) · Zbl 0078.29402
[3] E. Breuillard, M. Kalantar, M. Kennedy, and N. Ozawa, C*-Simplicity and the Unique Trace Property for Discrete Groups, arXiv: 1410.2518 (2014). · Zbl 1391.46071
[4] A. Le Boudec, Discrete Groups That are Not C*-Simple, arXiv: 1507.03452 (2015).
[5] Powers, R. T., Simplicity of the C*-algebra associated with the free group on two generators, Duke Math. J., 42, 151-156, (1975) · Zbl 0342.46046
[6] Paschke, W. L.; Salinas, N., C*-algebras associated with free products of groups, Pacific J.Math., 82, 211-221, (1979) · Zbl 0413.46049
[7] Bridson, M. R.; de la Harp, P., Mapping class groups and outer automorphism groups of free groups are C*-simple, J. Funct. Anal., 212, 195-205, (2004) · Zbl 1064.46052
[8] Arzhantseva, G.; Minasyan, A., Relatively hyperbolic groups are C*-simple, J. Funct. Anal., 243, 345-351, (2007) · Zbl 1115.20034
[9] Olshanskii, A. Yu.; Osin, D. V., C*-simple groups without free subgroups, Groups Geom. Dyn., 8, 933-983, (2014) · Zbl 1354.22009
[10] Adyan, S. I., Random walks on free periodic groups, Izv. Akad. Nauk SSSR Ser. Mat., 46, 1139-1149, (1982) · Zbl 0512.60012
[11] Atabekyan, V. S., On subgroups of free Burnside groups of odd exponent n = 1003, Izv. Ross. Akad. Nauk Ser. Mat., 73, 3-36, (2009) · Zbl 1226.20029
[12] Adyan, S. I., Periodic products of groups, 3-21, (1976) · Zbl 0424.20020
[13] S. I. Adyan, Burnside’s Problem and Identities in Groups (Nauka, Moscow, 1975) [in Russian]. · Zbl 0306.20045
[14] Adyan, S. I., New estimates of odd exponents in infinite Burnside groups, 31-82, (2015), Moscow
[15] Adyan, S. I.; Atabekyan, V. S., Characteristic properties and uniform non-amenability of n-periodic products of groups, Izv. Ross. Akad. Nauk Ser. Mat., 79, 3-17, (2015)
[16] Atabekyan, V. S., Uniform nonamenability of subgroups of free Burnside groups of odd period, Mat. Zametki, 85, 516-523, (2009) · Zbl 1213.20036
[17] Adyan, S. I., On the simplicity of periodic products of groups, Dokl. Akad. Nauk SSSR, 241, 745-748, (1978) · Zbl 0416.20024
[18] Adyan, S. I.; Lysenok, I. G., On groups all of whose proper subgroups are finite cyclic, Izv. Akad. Nauk SSSR Ser. Mat., 55, 933-990, (1991) · Zbl 0771.20015
[19] Atabekyan, V. S., On periodic groups of odd period n = 1003, Mat. Zametki, 82, 495-500, (2007) · Zbl 1152.20034
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.