SearcharxivSearch

arXiv · math/9310202

The Bieri-Neumann-Strebel invariants for graph groups

Abstract

Given a finite simplicial graph ${\cal G}$, the graph group $G{\cal G}$" is the group with generators in one-to-one correspondence with the vertices of ${\cal G}$ and with relations stating two generators commute if their associated vertices are adjacent in ${\cal G}$. The Bieri-Neumann-Strebel invariant can be explicitly described in terms of the original graph ${\cal G}$ and hence there is an explicit description of the distribution of finitely generated normal subgroups of $G{\cal G}$ with abelian quotient. We construct Eilenberg-MacLane spaces for graph groups and find partial extensions of this work to the higher dimensional invariants.

Explore related subjects

Keep this discovery

BibTeXRIS

John Meier, Leonard Vanwyk. 1993-10-12. The Bieri-Neumann-Strebel invariants for graph groups. https://arxiv.org/abs/math/9310202

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