SearcharxivSearch

arXiv · 2311.12910

The Hanna Neumann Conjecture for graphs of free groups with cyclic edge groups

Abstract

The Hanna Neumann Conjecture (HNC) for a free group $G$ predicts that $\overline{\chi}(U\cap V)\leq \overline{\chi} (U)\overline{\chi}(V)$ for all finitely generated subgroups $U$ and $V$, where $\overline{\chi}(H) = \max\{-\chi(H),0\}$ denotes the reduced Euler characteristic of $H$. A strengthened version of the HNC was proved independently by Friedman and Mineyev in 2011. Recently, Antol\'in and Jaikin-Zapirain introduced the $L^2$-Hall property and showed that if $G$ is a hyperbolic limit group that satisfies this property, then $G$ satisfies the HNC. Antol\'in and Jaikin-Zapirain established the $L^2$-Hall property for free and surface groups, which Brown and Kharlampovich extended to all limit groups. In this article, we prove the $L^2$-Hall property for graphs of free groups with cyclic edge groups that are hyperbolic relative to virtually abelian subgroups. We also give another proof of the $L^2$-Hall property for limit groups. As a corollary, we show that all these groups satisfy a strengthened version of the HNC.

Explore related subjects

Keep this discovery

BibTeXRIS

Sam P. Fisher, Ismael Morales. 2023-11-21. The Hanna Neumann Conjecture for graphs of free groups with cyclic edge groups. https://doi.org/10.1112/s0010437x25007444

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