SearcharxivSearch

arXiv · 2009.10137

Finite groups, minimal bases and the intersection number

Abstract

Let $G$ be a finite group and recall that the Frattini subgroup ${\rm Frat}(G)$ is the intersection of all the maximal subgroups of $G$. In this paper, we investigate the intersection number of $G$, denoted $\alpha(G)$, which is the minimal number of maximal subgroups whose intersection coincides with ${\rm Frat}(G)$. In earlier work, we studied $\alpha(G)$ in the special case where $G$ is simple and here we extend the analysis to almost simple groups. In particular, we prove that $\alpha(G) \leqslant 4$ for every almost simple group $G$, which is best possible. We also establish new results on the intersection number of arbitrary finite groups, obtaining upper bounds that are defined in terms of the chief factors of the group. Finally, for almost simple groups $G$ we present best possible bounds on a related invariant $\beta(G)$, which we call the base number of $G$. In this setting, $\beta(G)$ is the minimal base size of $G$ as we range over all faithful primitive actions of the group and we prove that the bound $\beta(G) \leqslant 4$ is optimal. Along the way, we study bases for the primitive action of the symmetric group $S_{ab}$ on the set of partitions of $[1,ab]$ into $a$ parts of size $b$, determining the exact base size for $a \geqslant b$. This extends earlier work of Benbenishty, Cohen and Niemeyer.

Explore related subjects

Keep this discovery

BibTeXRIS

Timothy C. Burness, Martino Garonzi, Andrea Lucchini. 2020-09-21. Finite groups, minimal bases and the intersection number. https://arxiv.org/abs/2009.10137

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