Kazhdan's Property (T) for Graphs

Details Kazhdan's Property (T) for Graphs Kazhdan's Property (T) for Graphs

2006-07-14

arxiv.org/abs/math/0607351v1

Mathematics

Combinatorics

13 pages

Scientific paper

D. A. Kahzdan first put forth property (T) in relation to the study of discrete subgroups of Lie groups of finite co-volume. Through a combinatorial approach, we define an analogue of property (T) for regular graphs. We then prove the basic combinatorial and metric properties of Kazhdan groups in this context. In particular, we use our methods to construct infinite families of expanders as in the classical case. Finally, we consider the combinatorial analogue of the group theoretic property $(\tau)$ and prove its basic properties.

Affiliated with

Also associated with

No associations

Rating

Kazhdan's Property (T) for Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kazhdan's Property (T) for Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kazhdan's Property (T) for Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-97264