arXiv Analytics

Sign in

arXiv:0811.3303 [math.GR]AbstractReferencesReviewsResources

Compressed word problems in HNN-extensions and amalgamated products

Niko Haubold, Markus Lohrey

Published 2008-11-20Version 1

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.

Categories: math.GR
Subjects: 20F10, 68Q17
Related articles: Most relevant | Search more
arXiv:2107.01630 [math.GR] (Published 2021-07-04)
Complexity of word problems for HNN-extensions
arXiv:2005.13917 [math.GR] (Published 2020-05-28)
The compressed word problem in relatively hyperbolic groups
arXiv:2202.04038 [math.GR] (Published 2022-02-08)
Exponent equations in HNN-extensions

Links

Toolbox