arXiv Analytics

Sign in

arXiv:1909.11163 [math.GR]AbstractReferencesReviewsResources

Descriptive complexity of subsets of the space of finitely generated groups

Mustafa Gökhan Benli, Burak Kaya

Published 2019-09-24Version 1

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, we establish that the sets of solvable groups and groups of exponential growth are $\mathbf{\Sigma}^0_2$-complete and that the sets of periodic groups and groups of intermediate growth are $\mathbf{\Pi}^0_2$-complete. This paper is intended to serve as a compilation of results on this theme.

Related articles: Most relevant | Search more
arXiv:math/0110176 [math.GR] (Published 2001-10-17, updated 2003-05-22)
On uniqueness of JSJ decompositions of finitely generated groups
arXiv:1507.06908 [math.GR] (Published 2015-07-24)
Determining solubility for finitely generated groups of PL homeomorphisms
arXiv:1607.08899 [math.GR] (Published 2016-07-29)
Boundary convex cocompactness and stability of subgroups of finitely generated groups