SearcharxivSearch

arXiv · 2103.11875

Effective discreteness radius of stabilisers for stationary actions

Abstract

We prove an effective variant of the Kazhdan-Margulis theorem generalized to stationary actions of semisimple groups over local fields: the probability that the stabilizer of a random point admits a non-trivial intersection with a small $r$-neighborhood of the identity is at most $\beta r^\delta$ for some explicit constants $\beta, \delta > 0$ depending only the group. This is a consequence of a key convolution inequality. We deduce that vanishing at infinity of injectivity radius implies finiteness of volume. Further applications are the compactness of the space of discrete stationary random subgroups and a novel proof of the fact that all lattices in semisimple groups are weakly cocompact.

Explore related subjects

Keep this discovery

BibTeXRIS

Tsachik Gelander, Arie Levit, Gregory Margulis. 2021-03-22. Effective discreteness radius of stabilisers for stationary actions. https://arxiv.org/abs/2103.11875

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