SearcharxivSearch

arXiv · 2506.12442

Explicit construction of benign subgroup for Higman's reversing operation

Abstract

For the Higman reversing operation $\rho$ and for a set of integer-valued functions $\mathcal X$ the following has been proved. Let the subgroup $A_{\mathcal X}$ be benign in the free group $F$, let the respective finitely presented overgroup $K_{\mathcal X}$ with its finitely generated subgroup $L_{\mathcal X}$ be given for $A_{\mathcal X}$ explicitly, and let the set $\mathcal Y = \rho\mathcal X$ be obtained from $\mathcal X$ by the reversing operation $\rho$. Then $A_{\mathcal Y}$ also is benign in $F$ and, moreover, the finitely presented overgroup $K_{\mathcal Y}$ with its finitely generated subgroup $L_{\mathcal Y}$ can also be given explicitly for it. The current work is a step in development of a general algorithm for construction of explicit Higman embeddings of recursive groups into finitely presented groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

V. H. Mikaelian. 2025-06-14. Explicit construction of benign subgroup for Higman's reversing operation. https://arxiv.org/abs/2506.12442

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