Search arXivSearch

arXiv · 2003.12882

Products of normal subsets and derangements

Abstract

In recent years there has been significant progress in the study of products of subsets of finite groups and of finite simple groups in particular. In this paper we consider which families of finite simple groups $G$ have the property that for each $\epsilon > 0$ there exists $N > 0$ such that, if $|G| \ge N$ and $S, T$ are normal subsets of $G$ with at least $\epsilon |G|$ elements each, then every non-trivial element of $G$ is the product of an element of $S$ and an element of $T$. We show that this holds in a strong sense for finite simple groups of Lie type of bounded rank, while it does not hold for alternating groups or groups of the form ${\mathrm{PSL}}_n(q)$ where $q$ is fixed and $n$ tends to infinity. Our second main result is that any element in a transitive permutation representation of a sufficiently large finite simple group is a product of two derangements.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Larsen, Aner Shalev, Pham Huu Tiep. 2020-03-28. Products of normal subsets and derangements. https://arxiv.org/abs/2003.12882

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