2000 character limit reached
Diameter Bound for Finite Simple Groups of Large Rank
Published 27 Nov 2015 in math.GR | (1511.08535v3)
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)}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.