Diameter of classical groups generated by transvections
Sean Eberhard

TL;DR
This paper proves that the diameter of Cayley graphs of classical groups generated by transvections is polynomially bounded, confirming Babai's conjecture for these groups and certain generating sets, with implications for random generators.
Contribution
It establishes a polynomial bound on the diameter of Cayley graphs of classical groups generated by transvections, confirming Babai's conjecture in this context.
Findings
Diameter bounded by (n log q)^C for some constant C
High probability diameter bound of n^{O(log q)} with three random generators
Confirms Babai's conjecture for classical groups over small fields
Abstract
Let be a finite classical group generated by transvections, i.e., one of , , , or ( even), and let be a generating set for containing at least one transvection. Building on work of Garonzi, Halasi, and Somlai, we prove that the diameter of the Cayley graph is bounded by for some constant . This confirms Babai's conjecture on the diameter of finite simple groups in the case of generating sets containing a transvection. By combining this with a result of the author and Jezernik it follows that if is one of , , and contains three random generators then with high probability the diameter is bounded by $n^{O(\log…
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
TopicsLimits and Structures in Graph Theory · Finite Group Theory Research
