Universal lattices and unbounded rank expanders
Abstract
We study the representations of non-commutative universal lattices and use them to compute lower bounds for the for the commutative universal lattices Gd,k= d([x1,...,xk]) with respect to several generating sets. As an application of the above result we show that the Cayley graphs of the finite groups 3k(p) can be made expanders using suitable choice of the generators. This provides the first examples of expander families of groups of Lie type where the rank is not bounded and gives a natural (and explicit) counter examples to two conjectures of Alex Lubotzky and Benjamin Weiss.
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.