SearcharxivSearch

arXiv · 2208.07347

Charmenability and Stiffness of Arithmetic Groups

Abstract

We characterize charmenability among arithmetic groups and deduce dichotomy statements pertaining normal subgroups, characters, dynamics, representations and associated operator algebras. We do this by studying the stationary dynamics on the space of characters of the amenable radical, and in particular we establish stiffness: any stationary probability measure is invariant. This generalizes a classical result of Furstenberg for dynamics on the torus. Under a higher rank assumption, we show that any action on the space of characters of a finitely generated virtually nilpotent group is stiff.

Explore related subjects

Keep this discovery

BibTeXRIS

Uri Bader, Itamar Vigdorovich. 2022-08-15. Charmenability and Stiffness of Arithmetic Groups. https://arxiv.org/abs/2208.07347

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