SearcharxivSearch

arXiv · 2302.09811

The Kervaire conjecture and the minimal complexity of surfaces

Abstract

The Kervaire conjecture asserts that adding a generator and then a relator to a nontrivial group always results in a nontrivial group. We introduce new methods from stable commutator length to study this type of problems about nontriviality of one-relator quotients. Roughly, we show that surfaces in certain HNN extensions bounding a given word have complexity no less than the complexity of its boundary. A consequence of this is a Freiheitssatz theorem for HNN extensions, which in particular implies and gives a new proof of Klyachko's theorem that confirms the Kervaire conjecture for torsion-free groups. As another application, we also generalize the following theorem of Klyachko-Lurye to HNN extensions: For any group $G$ and the quotient $Q$ of $G\star\mathbb{Z}$ by any proper power $w^m$ with $w\in G\star\mathbb{Z}$ projecting to $1\in\mathbb{Z}$, the natural map $G\to Q$ is injective.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lvzhou Chen. 2023-02-20. The Kervaire conjecture and the minimal complexity of surfaces. https://arxiv.org/abs/2302.09811

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