Descriptive complexity of subsets of the space of finitely generated groups

Creative Commons License

BENLİ M. G., KAYA B.

Expositiones Mathematicae, cilt.40, sa.4, ss.1116-1134, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 40 Sayı: 4
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1016/j.exmath.2022.08.001
  • Dergi Adı: Expositiones Mathematicae
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, MathSciNet, zbMATH
  • Sayfa Sayıları: ss.1116-1134
  • Anahtar Kelimeler: Finitely generated groups, Marked groups, Descriptive complexity, Borel hierarchy, AMENABLE-GROUPS
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

© 2022 Elsevier GmbHIn this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups, groups of exponential growth and groups with decidable word problem are Σ20-complete and that the sets of periodic groups and groups of intermediate growth are Π20-complete. We also provide bounds for the descriptive complexity of simplicity, amenability, residually finiteness, Hopficity and co-Hopficity. This paper is intended to serve as a compilation of results on this theme.