Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEnumerating limit groups
134
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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 always have good geometric properties (in particular, they are always relatively hyperbolic). Given a strict resolution of an arbitrary $Gamma$--limit group $L$, we canonically construct a strict resolution of a model $Gamma$--limit group, which encodes all homomorphisms $Lto Gamma$ that factor through the given resolution. We propose this as the correct framework in which to study $Gamma$--limit groups algorithmically. We enumerate all $Gamma$--limit groups in this framework.
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 finitely generated group and F is a non-abelian free group.
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 fact that the profinite completion of limit groups belong to this class, results on their group-theoretical structure and homological properties are obtained.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
