Kazhdan Constants for
arXiv:math/0311487
Abstract
In this article we improve the known Kazhdan constant for with respect to the generating set of the elementary matrices. We prove that the Kazhdan constant is bounded from below by , which gives the exact asymptotic behavior of the Kazhdan constant, as goes to infinity, since is an upper bound. We can use this bound to improve the bounds for the spectral gap of the Cayley graph of and for the working time of the product replacement algorithm for abelian groups.
22 pages