SearcharxivSearch

arXiv · 2311.15652

Minimal cover groups

Abstract

Let $\mathcal{F}$ be a set of finite groups. A finite group $G$ is called an \emph{$\mathcal{F}$-cover} if every group in $\mathcal{F}$ is isomorphic to a subgroup of $G$. An $\mathcal{F}$-cover is called \emph{minimal} if no proper subgroup of $G$ is an $\mathcal{F}$-cover, and \emph{minimum} if its order is smallest among all $\mathcal{F}$-covers. We prove several results about minimal and minimum $\mathcal{F}$-covers: for example, every minimal cover of a set of $p$-groups (for $p$ prime) is a $p$-group (and there may be finitely or infinitely many, for a given set); every minimal cover of a set of perfect groups is perfect; and a minimum cover of a set of two nonabelian simple groups is either their direct product or simple. Our major theorem determines whether $\{\mathbb{Z}_q,\mathbb{Z}_r\}$ has finitely many minimal covers, where $q$ and $r$ are distinct primes. Motivated by this, we say that $n$ is a \emph{Cauchy number} if there are only finitely many groups which are minimal (under inclusion) with respect to having order divisible by $n$, and we determine all such numbers. This extends Cauchy's theorem. We also define a dual concept where subgroups are replaced by quotients, and we pose a number of problems.

Explore related subjects

Keep this discovery

BibTeXRIS

Peter J. Cameron, David Craven, Hamid Reza Dorbidi, Scott Harper, Benjamin Sambale. 2023-11-27. Minimal cover groups. https://arxiv.org/abs/2311.15652

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