SearcharxivSearch

arXiv · 2603.11309

When are Two Subgroups Independent?

Abstract

Rosenmann and Ventura asked "What is the right definition of dependence of subgroups for general groups?". Here we aim to answer this question. We consider a definition of subgroup independence which is a special case of a category-theoretic one. It is that: Two subgroups of a group are independent if and only if any two endomorphisms, one acting on each subgroup, can be extended to an endomorphism of the group generated by these subgroups. This definition helps to illuminate that the usual condition of almost disjointness of subgroups (two subgroups $A$ and $B$ are almost disjoint if and only if $A \cap B = \{e\}$, where $e$ is the identity element) is not enough to force independence and here we find necessary and (different) sufficient conditions for subgroup independence. The aim of this note is to introduce this general notion of subgroup independence to the group theory community and to pose the open question of its characterisation. We present the partial results known up to this point. Moreover, we use the progress made so far to give a heuristic algorithm that decides subgroup independence for many cases.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alexa Gopaulsingh. 2026-03-11. When are Two Subgroups Independent?. https://arxiv.org/abs/2603.11309

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