English

On a cheeger type inequality in Cayley graphs of finite groups

Group Theory 2019-06-20 v2

Abstract

Let GG be a finite group. It was remarked by Breuillard-Green-Guralnick-Tao that if the Cayley graph C(G,S)C(G,S) is an expander graph and is non-bipartite then the spectrum of the adjacency operator TT is bounded away from 1-1. In this article we are interested in explicit bounds for the spectrum of these graphs. Specifically, we show that the non-trivial spectrum of the adjacency operator lies in the interval [1+h(G)4γ,1h(G)22d2]\left[-1+\frac{h(\mathbb{G})^{4}}{\gamma}, 1-\frac{h(\mathbb{G})^{2}}{2d^{2}}\right], where h(G)h(\mathbb{G}) denotes the (vertex) Cheeger constant of the dd regular graph C(G,S)C(G,S) with respect to a symmetric set SS of generators and γ=29d6(d+1)2\gamma = 2^{9}d^{6}(d+1)^{2}.

Keywords

Cite

@article{arxiv.1803.03969,
  title  = {On a cheeger type inequality in Cayley graphs of finite groups},
  author = {Arindam Biswas},
  journal= {arXiv preprint arXiv:1803.03969},
  year   = {2019}
}

Comments

Final version, to appear in the European Journal of Combinatorics