Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Babai's conjecture for high-rank classical groups with random generators (2005.09990v2)

Published 20 May 2020 in math.GR and math.CO

Abstract: Let $G = \mathrm{SCl}_n(q)$ be a quasisimple classical group with $n$ large, and let $x_1, \dots, x_k \in G$ random, where $k \geq qC$. We show that the diameter of the resulting Cayley graph is bounded by $q2 n{O(1)}$ with probability $1 - o(1)$. In the particular case $G = \mathrm{SL}_n(p)$ with $p$ a prime of bounded size, we show that the same holds for $k = 3$.

Summary

We haven't generated a summary for this paper yet.