SearcharxivSearch

arXiv · 1106.2242

Random groups and Property (T): Żuk's theorem revisited

Abstract

We provide a full and rigorous proof of a theorem attributed to Żuk, stating that random groups in the Gromov density model for d > 1/3 have property (T) with high probability. The original paper had numerous gaps, in particular, crucial steps involving passing between different models of random groups were not described. We fix the gaps using combinatorial arguments and a recent result concerning perfect matchings in random hypergraphs. We also provide an alternative proof, avoiding combinatorial difficulties and relying solely on spectral properties of random graphs in G(n, p) model.

Explore related subjects

Keep this discovery

BibTeXRIS

Marcin Kotowski, Michal Kotowski. 2012-05-12. Random groups and Property (T): Żuk's theorem revisited. https://doi.org/10.1112/jlms%2Fjdt024

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