SearcharxivSearch

arXiv · 1912.04668

Automorphism groups of dense subgroups of R^n

Abstract

By an automorphism of a topological group G we mean an isomorphism of G onto itself which is also a homeomorphism. In this article, we study the automorphism group Aut(G) of a dense subgroup G of R^n, n>=1. We show that Aut(G) can be naturally identified with the subgroup I(G)={A in GL(n,R): G A =G} of the group GL(n,R) of all non-degenerated (n x n)-matrices over R, where G A={g A:g in G}. We describe $I(G) for many dense subgroups G of either R or R^2. We consider also an inverse problem of which symmetric subgroups of GL(n,R) can be realized as I(G) for some dense subgroup G of R^n. For example, for n>=2, we show that the group {A in GL(n,R): det A=+-1} cannot be realized in this way. The realization problem is quite non-trivial even in the one-dimensional case and has deep connections to number theory.

Explore related subjects

Keep this discovery

BibTeXRIS

Vitalij Chatyrko, Dmitri Shakhmatov. 2019-12-10. Automorphism groups of dense subgroups of R^n. https://arxiv.org/abs/1912.04668

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