SearcharxivSearch

arXiv · 2608.27579

Groups satisfying Gasch\"utz's complement theorem

Abstract

A classical theorem of Gasch\"utz states that an abelian normal subgroup N of a finite group G has a complement in G whenever it has a complement in some subgroup H with $N \leq H \leq G$ and gcd(|N|, [G:H]) = 1. We characterize the finite groups N for which this theorem remains valid without the abelian hypothesis: this is the case if and only if $Z(N) \cap N' = 1$ and N has a complement in a quotient of the holomorph Hol(N) by a diagonal copy of N'. This completes a previous paper by the second author.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Stefanos Aivazidis, Benjamin Sambale. 2026-08-27. Groups satisfying Gasch\"utz's complement theorem. https://arxiv.org/abs/2608.27579

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