Author:
Davila Manuel, ,Hayes Travis,Krebs Mike,Reyes Marcos, , ,
Abstract
Let G be a finite group, and let Γ be a subset of G. The Kazhdan constant of the pair (G,Γ) is defined to bethe maximum distance we can guarantee that an arbitrary unitvector in an arbitrary nontrivial irreducible unitary representation space of G can be moved by some element of Γ. The Kazhdanconstant relates to the expansion properties of the Cayley graph generated by G and Γ, and has been much studied in this context. Different pairs (G1,Γ1) and (G2,Γ2) may give rise to isomorphic Cayley graphs. In this paper, we investigate the question: To whatextent is the Kazhdan constant a graph invariant? In other words, if the pairs yield isomorphic Cayley graphs, must the corresponding Kazhdan constants be equal? In our main theorem, we constructan infinite family of such pairs where the Kazhdan constants areunequal. Other relevant results are presented as well.
Publisher
Luhansk Taras Shevchenko National University
Subject
Discrete Mathematics and Combinatorics,Algebra and Number Theory
Reference10 articles.
1. [1]L. Babai, Isomorphism problem for a class of point-symmetric structures, ActaMath. Acad. Sci. Hungar. 29(1977), no. 3-4, 329-336.
2. [2] L. Babai, Spectra of Cayley graphs, Journal of Combinatorial Theory, Series B27(1979), 180-189.
3. [3]R. Bacher and P. De La Harpe, Exact values of Kazhdan constants for some finitegroups, Journal of Algebra 163(1994), 495-515.
4. [4]J. Derbidge, Kazhdan constants of cyclic groups, Master's thesis, California State University, Los Angeles, Los Angeles 2010.
5. [5]B. Elspas and J. Turner, Graphs with circulant adjacency matrices, J. Combin. Theory 9(1970), 297-307.