Symmetric Groups and Expander Graphs
Abstract
We construct explicit generating sets Sn and Sn of the for the alternating and the symmetric groups, which turn the Cayley graphs C(Alt(n), Sn) and C(Sym(n), Sn) into a family of bounded degree expanders for all n. This answers affirmatively an old question which has been asked many times in the literature. These expanders have many applications in the theory of random walks on groups, card shuffling and other areas.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.