Computing equations for residually free groups

Details Computing equations for residually free groups Computing equations for residually free groups

2009-02-12

arxiv.org/abs/0902.2119v2

Mathematics

Group Theory

5 pages. Updated reference

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Computing equations for residually free groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing equations for residually free groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing equations for residually free groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556640