English

Symmetric Groups and Expanders

Group Theory 2007-05-23 v1 Combinatorics

Abstract

We construct an explicit generating sets FnF_n and F~n\tilde F_n of the alternating and the symmetric groups, which make the Cayley graphs C(Alt(n),Fn)C(Alt(n), F_n) and C(Sym(n),F~n)C(Sym(n), \tilde F_n) a family of bounded degree expanders for all sufficiently large nn. These expanders have many applications in the theory of random walks on groups and other areas of mathematics.

Keywords

Cite

@article{arxiv.math/0503204,
  title  = {Symmetric Groups and Expanders},
  author = {Martin Kassabov},
  journal= {arXiv preprint arXiv:math/0503204},
  year   = {2007}
}

Comments

10 pages