Kazhdan Constants for SLn(Z)
Abstract
In this article we improve the known Kazhdan constant for SLn(Z) with respect to the generating set of the elementary matrices. We prove that the Kazhdan constant is bounded from below by [42n+860]-1, which gives the exact asymptotic behavior of the Kazhdan constant, as n goes to infinity, since 2/n is an upper bound. We can use this bound to improve the bounds for the spectral gap of the Cayley graph of SLn(Fp) and for the working time of the product replacement algorithm for abelian groups.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.