Babai's conjecture for high-rank classical groups with random generators
Sean Eberhard, Urban Jezernik

TL;DR
This paper proves that for large classical groups generated by many random elements, the Cayley graph's diameter is polynomially bounded with high probability, advancing understanding of group expansion and Babai's conjecture.
Contribution
It establishes diameter bounds for Cayley graphs of high-rank classical groups with random generators, including the case of a fixed number of generators for special groups.
Findings
Diameter bounded by $q^2 n^{O(1)}$ with high probability
For $G=SL_n(p)$ with fixed prime $p$, diameter bound holds with 3 generators
Results support Babai's conjecture for high-rank classical groups
Abstract
Let be a quasisimple classical group with large, and let random, where . We show that the diameter of the resulting Cayley graph is bounded by with probability . In the particular case with a prime of bounded size, we show that the same holds for .
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.
