Compressed word problems in HNN-extensions and amalgamated products

Simple item page
dc.creatorHaubold, Niko
dc.creatorLohrey, Markus
dc.date2008-11-20
dc.date.accessioned2026-07-07T10:19:44Z
dc.date.available2026-07-07T10:19:44Z
dc.descriptionIt 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.
dc.identifierhttps://arxiv.org/abs/0811.3303
dc.identifierhttp://arxiv.org/abs/0811.3303
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/174620
dc.subjectGroup Theory
dc.subject20F10; 68Q17
dc.titleCompressed word problems in HNN-extensions and amalgamated products
dc.typetext

Files

Collections

arXiv