Computing equations for residually free groups
Vincent Guirardel, Gilbert Levitt
Abstract
Open-access reader
Vincent Guirardel, Gilbert Levitt
Abstract
Open-access reader
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).
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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).
Key concepts: Mathematics, Pure mathematics