Compressed word problems in HNN-extensions and amalgamated products
Group Theory
2008-11-21 v1
Abstract
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.
Cite
@article{arxiv.0811.3303,
title = {Compressed word problems in HNN-extensions and amalgamated products},
author = {Niko Haubold and Markus Lohrey},
journal= {arXiv preprint arXiv:0811.3303},
year = {2008}
}