SearcharxivSearch

arXiv · 1912.07463

Products of finite connected subgroups

Abstract

For a non-empty class of groups $\cal L$, a finite group $G = AB$ is said to be an $\cal L$-connected product of the subgroups $A$ and $B$ if $\langle a, b\rangle \in \cal L$ for all $a \in A$ and $b \in B$. In a previous paper, we prove that for such a product, when $\cal L = \cal S$ is the class of finite soluble groups, then $[A,B]$ is soluble. This generalizes the theorem of Thompson which states the solubility of finite groups whose two-generated subgroups are soluble. In the present paper our result is applied to extend to finite groups previous research in the soluble universe. In particular, we characterize connected products for relevant classes of groups; among others the class of metanilpotent groups and the class of groups with nilpotent derived subgroup. Also we give local descriptions of relevant subgroups of finite groups.

Explore related subjects

Keep this discovery

BibTeXRIS

M. P. GÁllego, P. Hauck, L. S. Kazarin, A. MartÍnez-Pastor, M. D. Pérez-Ramos. 2019-12-16. Products of finite connected subgroups. https://arxiv.org/abs/1912.07463

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