Algorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection Properties

Simple item page
dc.creatorMarkus-Epstein, L.
dc.date2007-07-02
dc.date.accessioned2026-07-07T08:13:28Z
dc.date.available2026-07-07T08:13:28Z
dc.descriptionGeometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ the generalized Stallings' methods, developed by the author, to solve various algorithmic problems concerning finitely generated subgroups of amalgams of finite groups.
dc.description54 pages with 13 figures
dc.identifierhttps://arxiv.org/abs/0707.0165
dc.identifierhttp://arxiv.org/abs/0707.0165
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132782
dc.subjectGroup Theory
dc.subject20E06, 20F10
dc.titleAlgorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection Properties
dc.typetext

Files

Collections

arXiv