SearcharxivSearch

arXiv · 2511.21293

Property (VRC) and virtual fibering for amalgamated free products

Abstract

This paper focuses on studying properties of amalgamated free products $G=G_1*_{G_0} G_2$, where the amalgamated subgroup $G_0$ is virtually cyclic. First, we prove that if the factors $G_1$ and $G_2$ are finitely generated virtually abelian groups then $G$ can be mapped to another virtually abelian group so that this homomorphism is injective on each factor. We then present several applications of this result. In particular, we show that if $G_1$ and $G_2$ have property (VRC) (that is, every cyclic subgroup is a virtual retract), then the same is true for $G$. We also prove that $G$ inherits some residual properties (such as residual finiteness or virtual residual solvability) from the factors $G_i$, provided $G_0$ is a virtual retract of $G_i$, for $i=1,2$. Finally, we give necessary and sufficient conditions for $G$ to be (virtually) $F_m$-fibered. In particular, we fully characterize when an amalgamated product of two (finitely generated free)-by-cyclic groups over a cyclic subgroup is free-by-cyclic or virtually free-by-cyclic.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jon Merladet Urigüen, Ashot Minasyan. 2025-11-26. Property (VRC) and virtual fibering for amalgamated free products. https://arxiv.org/abs/2511.21293

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