pith. sign in

arxiv: 0902.2119 · v2 · pith:GJ4RVJH2new · submitted 2009-02-12 · 🧮 math.GR · math.GT

Computing equations for residually free groups

classification 🧮 math.GR math.GT
keywords finitelyfreeresiduallyequationsexplicitgivengroupgroups
0
0 comments X
read the original 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).

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.