SearcharxivSearch

arXiv · 2608.03561

Non Uniform Kazhdan Constant for Linear Groups

Abstract

A group $\Gamma$ generated by a finite set $S$ has Property $(T)$ if the associated Kazhdan constant $\kappa(\Gamma,S)$ is positive. If so, the same holds for every finite generating set $S$. There are Property $(T)$ groups which are uniformly $(T)$, and others which are not. It is a well-known problem whether the classical examples of Property $(T)$ groups, $\mathrm{SL}_n(\mathbb{Z})$, $n\geq 3$, are uniformly $(T)$ or not. We show that they are not. Moreover, the same holds for every infinite finitely generated linear group.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander Lubotzky, Jvbin Yao. 2026-08-04. Non Uniform Kazhdan Constant for Linear Groups. https://arxiv.org/abs/2608.03561

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