SearcharxivSearch

arXiv · 2512.19645

Subgroups of Cyclically Amalgamated Free Products

Abstract

Given a group $G = H_1 \ast_A H_2$ which is the free product of two finitely generated groups $H_1$ and $H_2$ with amalgamation over a cyclic subgroup $A$ which is malnormal in $G$, we study relations between the structure of its subgroups and the structure of the group $G$ itself. Firstly, we show that if $H_1$ and $H_2$ are 3-free products of cyclics of rank $\ge 3$ then $G$ is also a 3-free product of cyclics. Secondly, we prove that if $H_1$ and $H_2$ are 4-free products of cyclics of rank $\ge 4$ then every 4-generated subgroup of $G$ is a free product of $\le 4$ cyclics or a 1-relator quotient of a free product of four cyclic groups. Here a group is called an $n$-free product of cyclics if every $n$-generated subgroup is a free product of $\le n$ cyclic groups. These results are based on ubiquitous applications of the Nielsen method for amalgamated free products which we recall carefully. Lastly, given an infinite, finitely presented group which is not free, but all of its infinite index subgroups are free, a well-known conjecture says that it is isomorphic to a surface group. We revisit and elaborate on predominantly group theoretic proofs of this conjecture for cyclically amalgamated products as above, as well as for certain HNN extensions.

Explore related subjects

Keep this discovery

BibTeXRIS

Martin Kreuzer, Anja Moldenhauer, Gerhard Rosenberger. 2025-12-22. Subgroups of Cyclically Amalgamated Free Products. https://doi.org/10.46298/jgcc.2026.18.1.17174

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