SearcharxivSearch

arXiv · 1005.1858

Growth in finite simple groups of Lie type of bounded rank

Abstract

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple groups L of Lie type of bounded rank the diameter of any Cayley graph is polylogarithmic in |L|. We obtain a similar bound for the diameters of all Cayley graphs of perfect subgroups of GL(n,p) generated by their elements of order p. We also obtain some new families of expanders. We also prove the following partial extension. Let G be a subgroup of GL(n,p), p a prime, and S a symmetric set of generators of G satisfying |S^3|\le K|S| for some K. Then G has two normal subgroups H\ge P such that H/P is soluble, P is contained in S^6 and S is covered by K^c cosets of H where c depends on n. We obtain results of similar flavour for sets generating infinite subgroups of GL(n,F), F an arbitrary field.

Explore related subjects

Keep this discovery

BibTeXRIS

László Pyber, Endre Szabó. 2011-04-08. Growth in finite simple groups of Lie type of bounded rank. https://arxiv.org/abs/1005.1858

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