SearcharxivSearch

arXiv · 2505.18054

Virtual retractions in free constructions

Abstract

A group $G$ has property (VRC) if every cyclic subgroup is a virtual retract. This property is stable under many standard group-theoretic constructions and is enjoyed by all virtually special groups (in the sense of Haglund and Wise). In this paper we study property (VRC) for fundamental groups of finite graphs of groups. Our main criterion shows that the fundamental group of a finite graph of finitely generated virtually abelian groups has (VRC) if and only if it has a homomorphism to a Euclidean-by-finite group that is injective on all vertex groups. This result allows us to determine property (VRC) for such groups using basic tools from Euclidean Geometry and Linear Algebra. We use it to produce examples and to give sufficient criteria for fundamental groups of finite graphs of finitely generated abelian groups with cyclic edge groups to have (VRC). In the last two sections and in the appendix we give applications of property (VRC). We show that if a fundamental group of a finite graph of groups with finitely generated virtually abelian vertex groups has (VRC) then it is CAT($0$). We also show that tubular groups with (VRC) are virtually free-by-cyclic and virtually special.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jon Merladet Urigüen, Ashot Minasyan. 2025-05-23. Virtual retractions in free constructions. https://arxiv.org/abs/2505.18054

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