English

Computing equations for residually free groups

Group Theory 2019-06-07 v2 Geometric Topology

Abstract

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we discuss the possibility of finding an explicit set of defining equations (i.e. of expressing G as the maximal residually free quotient of an explicit finitely presented group).

Keywords

Cite

@article{arxiv.0902.2119,
  title  = {Computing equations for residually free groups},
  author = {Vincent Guirardel and Gilbert Levitt},
  journal= {arXiv preprint arXiv:0902.2119},
  year   = {2019}
}

Comments

5 pages. Updated reference

R2 v1 2026-06-21T12:10:49.812Z