Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1604.00609

The complexity of isomorphism between countably based profinite groups

Andre Nies
View original source ↗Read source document ↗Export metadata ↓

Abstract

A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based profinite group as a point in a Polish space. Then we study the complexity of isomorphism using the theory of Borel reducibility in descriptive set theory. For topologically finitely generated profinite groups this complexity is the same as the one of identity for reals. In general, it is the same as the complexity of isomorphism for countable graphs.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andre Nies. 2019-02-07. The complexity of isomorphism between countably based profinite groups. https://arxiv.org/abs/1604.00609

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR↗
arXiv2026

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR↗
arXiv2026

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR↗