Enumerating limit groups

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

14 pages; added recognition algorithms for free groups and surface groups

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Enumerating limit groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Enumerating limit groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enumerating limit groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-386932

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.