SearcharxivSearch

arXiv · math/0506306

Three amalgams with remarkable normal subgroup structures

Abstract

We construct three groups $Λ_1$, $Λ_2$, $Λ_3$, which can all be decomposed as amalgamated products $F_9 \ast_{F_{81}} F_{9}$ and have very few normal subgroups of finite or infinite index. Concretely, $Λ_1$ is a simple group, $Λ_2$ is not simple but has no non-trivial normal subgroup of infinite index, and $Λ_3$ is not simple but has no proper subgroup of finite index.

Explore related subjects

Keep this discovery

BibTeXRIS

Diego Rattaggi. 2005-06-15. Three amalgams with remarkable normal subgroup structures. https://arxiv.org/abs/math/0506306

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