Compressed word problems in HNN-extensions and amalgamated products

Details Compressed word problems in HNN-extensions and amalgamated products Compressed word problems in HNN-extensions and amalgamated products

2008-11-20

arxiv.org/abs/0811.3303v1

Mathematics

Group Theory

Scientific paper

It is shown that the compressed word problem for an HNN-extension with base
group H and finite associated subgroups is polynomial time Turing-reducible to
the compressed word problem for H. An analogous result for amalgamated free
products is shown as well.

Affiliated with

Also associated with

No associations

Rating

Compressed word problems in HNN-extensions and amalgamated products 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 Compressed word problems in HNN-extensions and amalgamated products, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed word problems in HNN-extensions and amalgamated products will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-668551