On the submonoid membership problem for HNN extensions of free groups

Jonathan Warne

Home/Archive/arXiv

arXiv · 2502.04865

On the submonoid membership problem for HNN extensions of free groups

Jonathan Warne

View original source ↗Read source document ↗Export metadata ↓

Abstract

We study membership problems in HNN extensions of free groups and then apply these results to solve the word problem in certain families of one-relator inverse monoids. In more detail, we consider HNN extensions where the defining isomorphism produces a bijection between subsets of a basis of the free group. Within such HNN extensions we identify natural conditions on submonoids of this group that suffice for membership in that submonoid to be decidable. We show that these results can then be applied to solve the prefix membership problem in certain one-relator groups which via results of Ivanov, Margolis and Meakin $(2001)$ then give solutions to the word problem for the corresponding one-relator inverse monoid. In particular our new techniques allow us to solve the word problem in an example (Example $7.6$) from Dolinka and Gray $(2021)$ which previous methods had not been able to resolve.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Jonathan Warne. 2025-02-07. On the submonoid membership problem for HNN extensions of free groups. https://arxiv.org/abs/2502.04865

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↗