Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1908.08214

Irreducible Nonsurjective Endomorphisms of $F_n$ are Hyperbolic

Jean Pierre Mutanguha
View original source ↗Read source document ↗Export metadata ↓

Abstract

Previously, Reynolds showed that any irreducible nonsurjective endomorphism can be represented by an irreducible immersion on a finite graph. We give a new proof of this and also show a partial converse holds when the immersion has connected Whitehead graphs with no cut vertices. The next result is a characterization of finitely generated subgroups of the free group that are invariant under an irreducible nonsurjective endomorphism. Consequently, irreducible nonsurjective endomorphisms are fully irreducible. The characterization and Reynolds' theorem imply that the mapping torus of an irreducible nonsurjective endomorphism is word-hyperbolic.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Jean Pierre Mutanguha. 2019-08-22. Irreducible Nonsurjective Endomorphisms of $F_n$ are Hyperbolic. https://doi.org/10.1112/blms.12377

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗