SearcharxivSearch

arXiv · 2410.06999

Normal covering numbers for $S_n$ and $A_n$ and additive combinatorics

Abstract

The normal covering number $\gamma(G)$ of a finite group $G$ is the minimum number of proper subgroups whose conjugates cover the group. We give various estimates for $\gamma(S_n)$ and $\gamma(A_n)$ depending on the arithmetic structure of $n$. In particular we determine the limsups over $\gamma(S_n) / n$ and $\gamma(A_n) / n$ over the sequences of even and odd integers, as well as the liminf of $\gamma(S_n) / n$ over even integers. In general we explain how the values of $\gamma(S_n) / n$ and $\gamma(A_n) / n$ are related to problems in additive combinatorics. These results answer most of the questions posed by Bubboloni, Praeger, and Spiga as Problem 20.17 of the Kourovka Notebook.

Explore related subjects

Keep this discovery

BibTeXRIS

Sean Eberhard, Connor Mellon. 2024-10-09. Normal covering numbers for $S_n$ and $A_n$ and additive combinatorics. https://doi.org/10.1112/blms.70154

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