SearcharxivSearch

arXiv · 2308.07086

Diameter of classical groups generated by transvections

Abstract

Let $G$ be a finite classical group generated by transvections, i.e., one of $\operatorname{SL}_n(q)$, $\operatorname{SU}_n(q)$, $\operatorname{Sp}_{2n}(q)$, or $\operatorname{O}^\pm_{2n}(q)$ ($q$ even), and let $X$ be a generating set for $G$ containing at least one transvection. Building on work of Garonzi, Halasi, and Somlai, we prove that the diameter of the Cayley graph $\operatorname{Cay}(G, X)$ is bounded by $(n \log q)^C$ for some constant $C$. This confirms Babai's conjecture on the diameter of finite simple groups in the case of generating sets containing a transvection. By combining this with a result of the author and Jezernik it follows that if $G$ is one of $\operatorname{SL}_n(q)$, $\operatorname{SU}_n(q)$, $\operatorname{Sp}_{2n}(q)$ and $X$ contains three random generators then with high probability the diameter $\operatorname{Cay}(G, X)$ is bounded by $n^{O(\log q)}$. This confirms Babai's conjecture for non-orthogonal classical simple groups over small fields and three random generators.

Explore related subjects

Keep this discovery

BibTeXRIS

Sean Eberhard. 2023-08-14. Diameter of classical groups generated by transvections. https://doi.org/10.1016/j.jalgebra.2024.05.009

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR