Search arXivSearch

arXiv · 1410.2540

Stackings and the W-cycle conjecture

Abstract

We prove Wise's $W$-cycles conjecture. Consider a compact graph $Γ'$ immering into another graph $Γ$. For any immersed cycle $Λ:S^1\to Γ$, we consider the map $Λ'$ from the circular components $\mathbb{S}$ of the pullback to $Γ'$. Unless $Λ'$ is reducible, the degree of the covering map $\mathbb{S}\to S^1$ is bounded above by minus the Euler characteristic of $Γ'$. As a consequence, we obtain a homological version of coherence for one-relator groups.

Explore related subjects

Keep this discovery

BibTeXRIS

Larsen Louder, Henry Wilton. 2014-10-09. Stackings and the W-cycle conjecture. https://arxiv.org/abs/1410.2540

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