Search arXivSearch

arXiv · math/0602148

Finiteness properties for a subgroup of the pure symmetric automorphism group

Abstract

Let F_n be the free group on n generators, and PΣ_n be the group of automorphisms of F_n which send each generator to a conjugate of itself. Let K_n be the kernel of the homomorphism from PΣ_n to PΣ_{n-1} induced by mapping one of the free group generators to the identity. We show that K_n has cohomological dimension n-1, and that the ith cohomology groups are infinitely generated for all i between 2 and n-1. It follows that K_n is not finitely presentable for n>2.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexandra Pettet. 2009-09-19. Finiteness properties for a subgroup of the pure symmetric automorphism group. https://arxiv.org/abs/math/0602148

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