Search arXivSearch

arXiv · 1901.09255

A generalization of a theorem of Rodgers and Saxl for simple groups of bounded rank

Abstract

We prove that if $G$ is a finite simple group of Lie type and $S_1,\dots, S_k$ are subsets of $G$ satisfying $\prod_{i=1}^k|S_i|\geq|G|^c$ for some $c$ depending only on the rank of $G$, then there exist elements $g_1,\dots, g_k$ such that $G=(S_1)^{g_1}\cdots (S_k)^{g_k}$. This theorem generalizes an earlier theorem of the authors and Short. We also propose two conjectures that relate our result to one of Rodgers and Saxl pertaining to conjugacy classes in $SL_n(q)$, as well as to the Product Decomposition Conjecture of Liebeck, Nikolov and Shalev.

Explore related subjects

Keep this discovery

BibTeXRIS

N. Gill, L. Pyber, E. Szabó. 2019-01-26. A generalization of a theorem of Rodgers and Saxl for simple groups of bounded rank. https://doi.org/10.1112/blms.12338

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