Hostname: page-component-6766d58669-kn6lq Total loading time: 0 Render date: 2026-05-19T15:14:48.048Z Has data issue: false hasContentIssue false

Stackings and the W-cycles Conjecture

Published online by Cambridge University Press:  20 November 2018

Larsen Louder
Affiliation:
University College London, London, UK. e-mail: l.louder@ucl.ac.uk
Henry Wilton
Affiliation:
University of Cambridge, Cambridge, UK. e-mail: h.wilton@maths.cam.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We prove Wise's $W$ -cycles conjecture. Consider a compact graph $\Gamma '$ immersing into another graph $\Gamma $ . For any immersed cycle $\Lambda :{{S}^{1}}\to \Gamma $ , we consider the map $\Lambda '$ from the circular components $\mathbb{S}$ of the pullback to $\Gamma '$ . Unless $\Lambda '$ is reducible, the degree of the covering map $\mathbb{S}\to {{S}^{1}}$ is bounded above by minus the Euler characteristic of $\Gamma '$ . As a corollary, any finitely generated subgroup of a one-relator group has a finitely generated Schur multiplier.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2017