SearcharxivSearch

arXiv · 1803.02671

Negative immersions for one-relator groups

Abstract

We prove a freeness theorem for low-rank subgroups of one-relator groups. Let $F$ be a free group, and let $w\in F$ be a non-primitive element. The primitivity rank of $w$, $\pi(w)$, is the smallest rank of a subgroup of $F$ containing $w$ as an imprimitive element. Then any subgroup of the one-relator group $G=F/\langle\langle w\rangle\rangle$ generated by fewer than $\pi(w)$ elements is free. In particular, if $\pi(w)>2$ then $G$ doesn't contain any Baumslag--Solitar groups. The hypothesis that $\pi(w)>2$ implies that the presentation complex $X$ of the one-relator group $G$ has negative immersions: if a compact, connected complex $Y$ immerses into $X$ and $\chi(Y)\geq 0$ then $Y$ is Nielsen equivalent to a graph. The freeness theorem is a consequence of a dependence theorem for free groups, which implies several classical facts about free and one-relator groups, including Magnus' Freiheitssatz and theorems of Lyndon, Baumslag, Stallings and Duncan--Howie. The dependence theorem strengthens Wise's $w$-cycles conjecture, proved independently by the authors and Helfer--Wise, which implies that the one-relator complex $X$ has non-positive immersions when $\pi(w)>1$.

Explore related subjects

Keep this discovery

BibTeXRIS

Larsen Louder, Henry Wilton. 2018-03-07. Negative immersions for one-relator groups. https://arxiv.org/abs/1803.02671

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