SearcharxivSearch

arXiv · 2606.28080

Sectionally indecomposable groups

Abstract

We introduce the notion of sectional indecomposability and study it for finite groups: a group $H$ is sectionally indecomposable if, whenever $H$ is a section of a direct product $A \times B$, then $H$ is already a section of $A$ or of $B$. We show that the study of sectionally indecomposable finite groups reduces to the monolithic case. Our main result is a complete characterisation of sectional indecomposability for monolithic primitive groups: such a group $G$ with $N = \mathrm{soc}(G)$ is sectionally indecomposable if and only if either $N$ is non-abelian, or $N$ is a $p$-group and $O_{p'}(G/N) \neq 1$. The proof relies on the introduction of the notion of an $H$-Frattini module and on the theory of the universal $p$-Frattini cover, together with a result of Griess--Schmid. As a corollary, every monolithic primitive solvable group is sectionally indecomposable. We also discuss the non-primitive case, which appears significantly harder, and highlight open questions concerning monolithic $p$-groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrea Lucchini, Nowras Otmen. 2026-06-26. Sectionally indecomposable groups. https://arxiv.org/abs/2606.28080

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