SearcharxivSearch

arXiv · 2412.15543

Prime power coverings of groups

Abstract

For a finite group $A$ with normal subgroup $G$, a subgroup $U$ of $G$ is an $A$-prime-power-covering subgroup if $U$ meets every $A$-conjugacy-class of elements of $G$ of prime power order. It is conjectured that $|G:U|$ is bounded by some function of $|A:G|$, and this conjecture has number theoretic implications for relative Brauer groups of algebraic number fields. We prove the conjecture in the case that the action of $G$ on the set of right cosets of $U$ in $G$ is innately transitive. This includes the case where $U$ is a maximal subgroup of $G$. The proof uses a new bound on the order of a nonabelian finite simple group in terms of its number of classes of elements of prime power order, which in turn depends on the Classification of the Finite Simple Groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Michael Giudici, Luke Morgan, Cheryl E. Praeger. 2024-12-20. Prime power coverings of groups. https://arxiv.org/abs/2412.15543

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