Expanding groups with large diameter
Sean Eberhard, Luca Sabatini

TL;DR
This paper demonstrates that the spectral gap and diameter of Cayley graphs can vary significantly depending on the generating set, providing explicit constructions where one Cayley graph is an expander and another has very large diameter.
Contribution
It answers a question by Pyber and Szabó by constructing groups with bounded generating sets producing both expanders and graphs with super-polylogarithmic diameter.
Findings
Constructed groups with bounded generating sets yielding both expanders and large-diameter graphs.
Showed the dependence of spectral gap and diameter on the choice of generating set.
Reduced analysis to bounding exponential sums of permutational type.
Abstract
We study how the spectral gap and diameter of Cayley graphs depend strongly on the choice of generating set. We answer a question of Pyber and Szab\'o (2013) by exhibiting a sequence of finite groups with admitting bounded generating sets such that is an expander while has super-polylogarithmic diameter. The construction uses the semidirect product with exponentially large in , and the analysis reduces to bounding some exponential sums of permutational type.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Advanced Combinatorial Mathematics · Finite Group Theory Research
