On the diameters of McKay graphs for finite simple groups
Martin W. Liebeck, Aner Shalev, and Pham Huu Tiep

TL;DR
This paper investigates the diameters of McKay graphs for finite simple groups, providing bounds that depend on the group's type and rank, with specific results for classical groups and symmetric groups.
Contribution
It establishes new bounds on the diameters of McKay graphs for various families of finite simple groups, including Lie type and symmetric groups.
Findings
Diameter bounded by quadratic function of rank for Lie type groups
Stronger bounds obtained for PSL_n(q) and PSU_n(q)
Diameter bounds for symmetric and alternating groups
Abstract
Let be a finite group, and a nontrivial character of . The McKay graph has the irreducible characters of as vertices, with an edge from to if is a constituent of . We study the diameters of McKay graphs for simple groups . For a group of Lie type, we show that for any , the diameter is bounded by a quadratic function of the rank, and obtain much stronger bounds for or . We also bound the diameter for symmetric and alternating groups.
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.
