SearcharxivSearch

arXiv · 2607.21493

Commutator relators of one-relator groups do not force Hopficity, residual finiteness, or automaticity

Abstract

Let $G=F/\langle\langle r\rangle\rangle$ be a one-relator group with the relator $r\in [F,F]$ or $r=[u,v] ~(u,v\in F)$, where $F$ is a finitely generated free group. Baumslag asked whether $G$ is Hopfian, residually finite or automatic. In the case of $r\in[F,F]$, a negative answer to the residual finiteness and automaticity has already been obtained by a result of Olshanskii. In this note, we construct a family of one-relator groups $$G_m=\left\langle a,t\ \middle|\ [t,a[a,t]^{-m}]\right\rangle,$$ whose relators are commutators, each of which has a Baumslag-Solitar subgroup as a retract. These groups provide negative answers to these three questions in both cases.

Explore related subjects

Keep this discovery

BibTeXRIS

Ke Wang, Qiang Zhang. 2026-07-23. Commutator relators of one-relator groups do not force Hopficity, residual finiteness, or automaticity. https://arxiv.org/abs/2607.21493

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