Search arXivSearch

arXiv · 2603.04612

Combinatorial Characterizations of Virtually Torsion-Free and Virtually Free Groups

Abstract

We establish combinatorial characterizations of virtually torsion-free and virtually free groups using the canonical graph decomposition theory in \cite{DJKK22}. Our main results show that a finitely presented, residually finite group $\Gamma$ is virtually torsion-free if and only if there exists a locality parameter $r>0$ such that its $r$-local cover admits a canonical tree-decomposition with finite quotient and finite adhesion, every finite subgroup of $\Gamma$ fixes a vertex of this decomposition, and the finite subgroups in each bag have uniformly bounded order. Moreover, a finitely generated group $\Gamma$ is virtually free if and only if for some $r>0$ its $r$-global decomposition has a finite model graph with finite bags and the tree-decomposition of the $r$-local cover is $\Gamma$-equivariantly isomorphic to the Bass--Serre tree arising from a splitting of $\Gamma$ as a finite graph of finite groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

R. Köhl, M. Reza Salarian. 2026-03-04. Combinatorial Characterizations of Virtually Torsion-Free and Virtually Free Groups. https://arxiv.org/abs/2603.04612

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