Table of Contents
Fetching ...

Free-abelian by free groups: homomorphisms and algorithmic explorations

André Carvalho, Jordi Delgado

Abstract

We obtain an explicit description of the endomorphisms of free-abelian by free groups together with a characterization of when they are injective and surjective. As a consequence we see that free-abelian by free groups are Hopfian and not coHopfian, and we investigate the isomorphism problem and the Brinkmann Problem for this family of groups. In particular, we prove that the isomorphism problem (undecidable in general) is decidable when restricted to finite actions, and that the Brinkmann Problem is decidable both for monomorphisms and automorphisms.

Free-abelian by free groups: homomorphisms and algorithmic explorations

Abstract

We obtain an explicit description of the endomorphisms of free-abelian by free groups together with a characterization of when they are injective and surjective. As a consequence we see that free-abelian by free groups are Hopfian and not coHopfian, and we investigate the isomorphism problem and the Brinkmann Problem for this family of groups. In particular, we prove that the isomorphism problem (undecidable in general) is decidable when restricted to finite actions, and that the Brinkmann Problem is decidable both for monomorphisms and automorphisms.
Paper Structure (7 sections, 30 theorems, 56 equations, 2 figures)

This paper contains 7 sections, 30 theorems, 56 equations, 2 figures.

Key Result

Lemma 1.1

Let $u \mathrm{t} ^{\mathbf{a}},w \mathrm{t} ^{\mathbf{c}} \in {\mathbb{G}_{\bm{\alpha}}}$. Then:

Figures (2)

  • Figure 1: (Undecidable) isomorphism condition for $\mathsf{FABF}$ groups
  • Figure :

Theorems & Definitions (56)

  • Lemma 1.1
  • Proposition 1.3
  • Lemma 2.1
  • Theorem 2.2
  • Corollary 2.3
  • Corollary 2.4
  • Corollary 2.5
  • proof
  • Remark 2.6
  • Lemma 2.7
  • ...and 46 more