SearcharxivSearch

arXiv · 2605.24772

Realizing Non-Archimedean Polish Groups as Outer Automorphism Groups

Abstract

We prove that every non-Archimedean Polish group is topologically isomorphic to the outer automorphism group of a countable discrete group. Furthermore, our construction is Borel. This implies that determining whether two countable discrete groups have topologically isomorphic outer automorphism groups is at least as complicated as classifying non-Archimedean Polish groups up to topological isomorphism, and so in particular not classifiable by countable structures. Our construction is based on the theory of right-angled Coxeter groups. Along the way, we prove results of independent interest on the topological group $\mathrm{Aut}(W)$, for $W$ a countable right-angled Coxeter group. This has purely group-theoretic applications; in particular, we give a graph-theoretic characterization of when the group $\mathrm{Spe}(W)$ of special automorphisms of $W$ coincides with $\mathrm{Inn}(W)$. Combined with previous work, this gives a characterization of when $\mathrm{Aut}(W)$ is inner-by-graph, for $W$ countable.

Explore related subjects

Keep this discovery

BibTeXRIS

Gianluca Paolini, Jean-Luc Rabideau. 2026-05-23. Realizing Non-Archimedean Polish Groups as Outer Automorphism Groups. https://arxiv.org/abs/2605.24772

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

KEEP EXPLORING

Related papers

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

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

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