Non-unitarisable representations and random forests

Inessa Epstein; Nicolas Monod

doi:10.1093/imrn/rnp090

Home/Archive/arXiv

arXiv · 0811.3422

Non-unitarisable representations and random forests

Inessa Epstein·Nicolas Monod

View original source ↗Read source document ↗Export metadata ↓

Abstract

We establish a connection between Dixmier's unitarisability problem and the expected degree of random forests on a group. As a consequence, a residually finite group is non-unitarisable if its first L2-Betti number is non-zero or if it is finitely generated with non-trivial cost. Our criterion also applies to torsion groups constructed by D. Osin, thus providing the first examples of non-unitarisable groups not containing a non-Abelian free subgroup.

Explore related subjects

math.GR math.FA

Keep this discovery

BibTeX RIS

Inessa Epstein, Nicolas Monod. 2008-12-08. Non-unitarisable representations and random forests. https://doi.org/10.1093/imrn%2Frnp090

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗

arXiv2026

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↗

arXiv2026

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↗