Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.19635

Ping-pong for basis-conjugating HNN-extension of free group

Vasily Ionin
View original source ↗Read source document ↗Export metadata ↓

Abstract

We isolate a tractable class of HNN-extensions of a free group, namely, multiple HNN-extensions by basis-conjugating embeddings. For this class, we construct a normal form and establish a practical version of the ping-pong lemma that provides verifiable sufficient conditions for a set of elements to generate a free subgroup. We then apply these results to the pure braid group $P_{n+1}$, exploiting its well-known decomposition as a semidirect product of free groups. Our approach yields new families of free subgroups within the first two factors $F_n \rtimes F_{n-1}$ of this decomposition.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

Vasily Ionin. 2025-09-23. Ping-pong for basis-conjugating HNN-extension of free group. https://arxiv.org/abs/2509.19635

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↗