Descriptive complexity of subsets of the space of finitely generated groups

DOI10.1016/J.EXMATH.2022.08.001arXiv1909.11163MaRDI QIDQ6325919FDOQ6325919

Authors: Mustafa Gökhan Benli, Burak Kaya 

Publication date: 24 September 2019

Abstract: In 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 $mathbf{Sigma}_2^0$-complete and that the sets of periodic groups and groups of intermediate growth are $mathbf{Pi}_2^0$-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.

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Descriptive set theory (03E15) Periodic groups; locally finite groups (20F50)

This page was built for publication: Descriptive complexity of subsets of the space of finitely generated groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325919)