Open Access
Spring 2010 Computing equations for residually free groups
Vincent Guirardel, Gilbert Levitt
Illinois J. Math. 54(1): 129-135 (Spring 2010). DOI: 10.1215/ijm/1299679741

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

Citation

Download Citation

Vincent Guirardel. Gilbert Levitt. "Computing equations for residually free groups." Illinois J. Math. 54 (1) 129 - 135, Spring 2010. https://doi.org/10.1215/ijm/1299679741

Information

Published: Spring 2010
First available in Project Euclid: 9 March 2011

zbMATH: 1214.20034
MathSciNet: MR2776988
Digital Object Identifier: 10.1215/ijm/1299679741

Subjects:
Primary: 20E26 , 20F10 , 20F65 , 20F67

Rights: Copyright © 2010 University of Illinois at Urbana-Champaign

Vol.54 • No. 1 • Spring 2010
Back to Top