International audienceWe 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)
We explore an elementary construction that produces finitely presented groups with diverse homologic...
El propósito del trabajo es introducir los problemas clásicos de decisión en la teoría de grupos hac...
We explore an elementary construction that produces finitely presented groups with diverse homologic...
International audienceWe show that there is no algorithm deciding whether the maximal residually fre...
AbstractWe introduce the notion of quantifying the extent to which a finitely generated group is res...
Abstract. We establish virtual surjection to pairs (VSP) as a general criterion for the finite prese...
We establish {\em{virtual surjection to pairs}} (VSP) as a general criterion for the finite presenta...
44 pages. To appear in American Journal of Mathematics. This is a substantial rewrite of our previou...
Abstract. We establish virtual surjection to pairs (VSP) as a general criterion for the finite prese...
Abstract. We give an example of a residually-p finitely generated group, that satisfies a non-trivia...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
We find a lower bound to the size of finite groups detecting a given word in the free group, more pr...
A filling subgroup of a finitely generated free group F(X) is a subgroup which does not fix a point ...
AbstractWe derive necessary and sufficient conditions for generalized free products of free groups o...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
We explore an elementary construction that produces finitely presented groups with diverse homologic...
El propósito del trabajo es introducir los problemas clásicos de decisión en la teoría de grupos hac...
We explore an elementary construction that produces finitely presented groups with diverse homologic...
International audienceWe show that there is no algorithm deciding whether the maximal residually fre...
AbstractWe introduce the notion of quantifying the extent to which a finitely generated group is res...
Abstract. We establish virtual surjection to pairs (VSP) as a general criterion for the finite prese...
We establish {\em{virtual surjection to pairs}} (VSP) as a general criterion for the finite presenta...
44 pages. To appear in American Journal of Mathematics. This is a substantial rewrite of our previou...
Abstract. We establish virtual surjection to pairs (VSP) as a general criterion for the finite prese...
Abstract. We give an example of a residually-p finitely generated group, that satisfies a non-trivia...
Every finitely presented group G has a quotient group with solvable word problem – namely the trivia...
We find a lower bound to the size of finite groups detecting a given word in the free group, more pr...
A filling subgroup of a finitely generated free group F(X) is a subgroup which does not fix a point ...
AbstractWe derive necessary and sufficient conditions for generalized free products of free groups o...
AbstractWe prove that the isomorphism problem for finitely generated fully residually free groups (o...
We explore an elementary construction that produces finitely presented groups with diverse homologic...
El propósito del trabajo es introducir los problemas clásicos de decisión en la teoría de grupos hac...
We explore an elementary construction that produces finitely presented groups with diverse homologic...