Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Diameter Bound for Finite Simple Groups of Large Rank (1511.08535v3)

Published 27 Nov 2015 in math.GR

Abstract: Given a non-abelian finite simple group $G$ of Lie type, and an arbitrary generating set $S$, it is conjectured by Laszlo Babai that its Cayley graph $\Gamma (G,S)$ will have a diameter of $(\log |G|){O(1)}$. However, little progress has been made when the rank of $G$ is large. In this article, we shall show that if $G$ has rank $n$, and its base field has order $q$, then the diameter of $\Gamma (G,S)$ would be $q{O(n(\log n + \log q)3)}$.

Summary

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