ﻻ يوجد ملخص باللغة العربية
We prove that the set of limit groups is recursive, answering a question of Delzant. One ingredient of the proof is the observation that a finitely presented group with local retractions (a la Long and Reid) is coherent and, furthermore, there exists an algorithm that computes presentations for finitely generated subgroups. The other main ingredient is the ability to algorithmically calculate centralizers in relatively hyperbolic groups. Applications include the existence of recognition algorithms for limit groups and free groups.
Let $Gamma$ be a torsion-free hyperbolic group. We study $Gamma$--limit groups which, unlike the fundamental case in which $Gamma$ is free, may not be finitely presentable or geometrically tractable. We define model $Gamma$--limit groups, which alway
We show that the Cantor-Bendixson rank of a limit group is finite as well as that of a limit group of a linear group.
This is the first in a planned series of papers giving an alternate approach to Zlil Selas work on the Tarski problems. The present paper is an exposition of work of Kharlampovich-Myasnikov and Sela giving a parametrization of Hom(G,F) where G is a f
There are limit groups having non-conjugate elements whose images are conjugate in every free quotient. Towers over free groups are freely conjugacy separable.
We introduce and investigate a class of profinite groups defined via extensions of centralizers analogous to the extensively studied class of finitely generated fully residually free groups, that is, limit groups (in the sense of Z. Sela). From the f