Diameter of Cayley graphs of $SL(n,p)$ with generating sets containing a\n transvection
Zoltán Halasi
Abstract
Open-access reader
Zoltán Halasi
Abstract
Open-access reader
A well-known conjecture of Babai states that if $G$ is a finite simple group\nand $X$ is a generating set of $G$, then the diameter of the Cayley graph\n$Cay(G,X)$ is bounded above by $(\\log |G|)^c$ for some absolute constant $c$.\nThe goal of this paper is to prove such a bound for the diameter of $Cay(G,X)$\nwhenever $G=SL(n,p)$ and $X$ is a generating set of $G$ which contains a\ntransvection. A natural analogue of this result is also proved for $G=SL(n,K)$,\nwhere $K$ can be any field.\n
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A well-known conjecture of Babai states that if $G$ is a finite simple group\nand $X$ is a generating set of $G$, then the diameter of the Cayley graph\n$Cay(G,X)$ is bounded above by $(\\log |G|)^c$ for some absolute constant $c$.\nThe goal of this paper is to prove such a bound for the diameter of $Cay(G,X)$\nwhenever $G=SL(n,p)$ and $X$ is a generating set of $G$ which contains a\ntransvection. A natural analogue of this result is also proved for $G=SL(n,K)$,\nwhere $K$ can be any field.\n
Key concepts: Cayley graph, Generating set of a group, Combinatorics, Mathematics, Conjecture, Bounded function, Graph, Cayley's theorem