SearcharxivSearch

arXiv · 2606.31221

Generic dense free subgroups of the isometry group of the Urysohn space are NSS

Abstract

The isometry group of the bounded Urysohn space, $G = \mathrm{Iso}(\U{1})$ is a central object in the study of Polish groups and topological dynamics. It is known that generic sequences in $G$ generate algebraically free dense subgroups. In this paper, we show that such generic free subgroups exhibit strong geometric rigidity. Specifically, we prove that for a comeager set of sequences generating dense free subgroups $F\leq G$, every non-trivial element $h\in F$ acts with maximal metric displacement, satisfying $\sup_{n\in \N} d(h^n(x),x) = 1$ for every $x \in \U{1}$. As a consequence, these generic subgroups satisfy the \emph{no small subgroup} ($\nss$) property. We note that the method naturally extends to the full isometry group $\mathrm{Iso}(\mathbb{U})$ of the classical Urysohn space.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Víctor Hugo Yañez. 2026-06-30. Generic dense free subgroups of the isometry group of the Urysohn space are NSS. https://arxiv.org/abs/2606.31221

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