SearcharxivSearch

arXiv · 1208.3075

On the Howson property of descending HNN-extensions of groups

Abstract

A group $G$ is said to have the Howson property (or to be a Howson group) if the intersection of any two finitely generated subgroups of $G$ is finitely generated subgroup. It is proved that descending HNN-extension is not a Howson group under some assumptions satisfied by the base group of HNN-extension. In particular, a result of the paper joined with a Burns - Brunner result (received in 1979) implies that any descending HNN-extension of non-cyclic free group does not have the Howson property.

Explore related subjects

Keep this discovery

BibTeXRIS

Moldavanskii David. 2012-08-15. On the Howson property of descending HNN-extensions of groups. https://arxiv.org/abs/1208.3075

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