Finitely presentable subgroups and algorithms

Details Finitely presentable subgroups and algorithms Finitely presentable subgroups and algorithms

2011-09-08

arxiv.org/abs/1109.1792v3

Mathematics

Group Theory

11 pages. This is the first version, comments are welcome. v2: 14 pages, small corrections made, introduction expanded, connec

Scientific paper

We show that there is a finitely presented group G for which there is no algorithm that takes a finitely presentable subgroup H of G, an abstract finite presentation Q for H, and constructs an isomorphism between Q and H. To do this, we show that there is a finitely presented group with solvable word problem (namely, the Baumslag-Solitar group BS(2,3)) for which there is no algorithm that takes a recursive presentation of that same group, and solves the word problem in the recursive presentation. Our main result suggests, but does not prove, that there is a genuine difference between strong effective coherence and weak effective coherence.

Affiliated with

Also associated with

No associations

Rating

Finitely presentable subgroups and algorithms 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 Finitely presentable subgroups and algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finitely presentable subgroups and algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-475645