SearcharxivSearch

arXiv · 2504.14057

On dissociated infinite permutation groups

Abstract

The goal of this paper is threefold. First, we describe the notion of dissociation for closed subgroups of the group of permutations on a countably infinite set and explain its numerous consequences on unitary representations (classification of unitary representations, Property (T), the Howe-Moore property, etc.) and on ergodic actions (non-existence of type III non-singular actions, Stabilizer rigidity, etc.). Some of the results presented here are new, others were proved in different contexts (notably some results of Tsankov). Second, we introduce a new method to prove dissociation. It is based on a reinforcement of the classical notion of strong amalgamation, where we allow to amalgamate over countable sets. Third, we apply this technique of amalgamation to provide new examples of dissociated closed permutation groups, including isometry groups of some countable metrically homogeneous spaces, automorphism groups of diversities, and more.

Explore related subjects

Keep this discovery

BibTeXRIS

Rémi Barritault, Colin Jahel, Matthieu Joseph. 2025-04-18. On dissociated infinite permutation groups. https://arxiv.org/abs/2504.14057

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