Subspace Arrangements and Property T

M. Kassabov

Home/Archive/arXiv

arXiv · 0911.1983

Subspace Arrangements and Property T

M. Kassabov

View original source ↗Read source document ↗Export metadata ↓

Abstract

We reformulate and extend the geometric method for proving Kazhdan property T developed by Dymara and Januszkiewicz and used by Ershov and Jaikin. The main result says that a group G, generated by finite subgroups G_i, has property T if the group generated by each pair of subgroups has property T and sufficiently large Kazhdan constant. Essentially, the same result was proven by Dymara and Januszkiewicz, however our bound for "sufficiently large" is significantly better. As an application of this result, we give exact bounds for the Kazhdan constants and the spectral gaps of the random walks on any finite Coxeter group with respect to the standard generating set, which generalizes a result of Bacher and de la Hapre.

Explore related subjects

math.GR

Keep this discovery

BibTeX RIS

M. Kassabov. 2009-11-10. Subspace Arrangements and Property T. https://arxiv.org/abs/0911.1983

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↗