SearcharxivSearch

arXiv · math/0701225

Generation Gaps and Abelianised Defects of Free Products

Abstract

Let G be a group of the form G_1* ... *G_n, the free product of n subgroups, and let M be a ZG-module of the form $\bigoplus_{i=1}^n M_i \otimes_{\mathbb{Z}G_i} \mathbb{Z}G$. We shall give formulae in various situations for $d_{ZG}(M)$, the minimum number of elements required to generate M. In particular if C_1,C_2 are non-trivial finite cyclic groups of coprime orders, $G = (C_1 \times Z) * (C_2 \times Z)$ and $F/R \cong G$ is the free presentation obtained from the natural free presentations of the two factors, then the number of generators of the relation module, $d_{\mathbb{Z}G}(R/R')$ is three. It seems plausible that the minimum number of relators of G should be 4, and this would give a finitely presented group with positive relation gap. However we cannot prove this last statement.

Explore related subjects

Keep this discovery

BibTeXRIS

Karl W. Gruenberg, Peter A. Linnell. 2007-12-26. Generation Gaps and Abelianised Defects of Free Products. https://arxiv.org/abs/math/0701225

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