English

Babai's conjecture for high-rank classical groups with random generators

Group Theory 2021-11-18 v2 Combinatorics

Abstract

Let G=SCln(q)G = \mathrm{SCl}_n(q) be a quasisimple classical group with nn large, and let x1,,xkGx_1, \dots, x_k \in G random, where kqCk \geq q^C. We show that the diameter of the resulting Cayley graph is bounded by q2nO(1)q^2 n^{O(1)} with probability 1o(1)1 - o(1). In the particular case G=SLn(p)G = \mathrm{SL}_n(p) with pp a prime of bounded size, we show that the same holds for k=3k = 3.

Keywords

Cite

@article{arxiv.2005.09990,
  title  = {Babai's conjecture for high-rank classical groups with random generators},
  author = {Sean Eberhard and Urban Jezernik},
  journal= {arXiv preprint arXiv:2005.09990},
  year   = {2021}
}

Comments

44 pages. Several typos corrected. Referee comments incorporated

R2 v1 2026-06-23T15:41:04.066Z